3396 search results - page 266 / 680 » Tree representations of graphs |
162
click to vote
EJC
2006
15 years 6 months ago
2006
We find the asymptotic number of connected graphs with k vertices and k - 1 + l edges when k, l approach infinity, reproving a result of Bender, Canfield and McKay. We use the pro...
168
click to vote
SIAMCOMP
2000
15 years 5 months ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
164
click to vote
IWPEC
2009
Springer
16 years 15 days ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
157
click to vote
LICS
1994
IEEE
15 years 10 months ago
1994
IEEE
abstract semantics for concurrent graph reduction ALAN JEFFREY This paper presents a fully abstract semantics for a variant of the untyped -calculus with recursive declarations. We...
166
click to vote
GBRPR
2009
Springer
16 years 16 days ago
2009
Springer
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...