34 search results - page 3 / 7 » Layout of Graphs with Bounded Tree-Width |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
SIAMJO
2008
13 years 5 months ago
2008
Eigenvectors to the second smallest eigenvalue of the Laplace matrix of a graph, also known as Fiedler vectors, are the basic ingredient in spectral graph partitioning heuristics....
FAW
2009
Springer
13 years 12 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
We propose the recursive grid layout scheme for deriving efficient layouts of a variety of hierarchical networks and computing upper bounds on the VLSI area of general hierarchica...
SIROCCO
2004
13 years 6 months ago
2004
Path Layout is a fundamental graph problem in label switching protocols. This problem is raised in various protocols such as the traditional ATM protocol and MPLS which is a new l...