10916 search results - page 313 / 2184 » On Constructive Connectives and Systems |
160
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
195
click to vote
AHSWN
2005
15 years 6 months ago
2005
Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods take into account the low interference as a goal of the methods. So...
180
click to vote
PPL
2000
15 years 6 months ago
2000
In this paper we consider the problem of constructing planar orthogonal grid drawings or more simply, layouts of graphs, with the goal of minimizing the number of bends along the ...
170
click to vote
TCAD
2002
15 years 6 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...
188
click to vote
JDA
2010
15 years 5 months ago
2010
We introduce and analyze σ-local graphs, based on a definition of locality by Erickson [12]. We present two algorithms to construct such graphs, for any real number σ > 1 an...