684 search results - page 14 / 137 » On embedding well-separable graphs |
ITCC
2003
IEEE
15 years 2 months ago
2003
IEEE
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
73
Voted
FAC
2002
14 years 9 months ago
2002
Action calculi, which generalise process calculi such as Petri nets, -calculus and ambient calculus, have been presented in terms of action graphs. We here offer linear action grap...
COMBINATORICS
2006
14 years 9 months ago
2006
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
COMBINATORICA
2007
14 years 9 months ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
SIAMJO
2008
14 years 9 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....