376 search results - page 29 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
ARSCOM
2008
13 years 8 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
JCT
2011
13 years 3 months ago
2011
The circumference of a graph is the length of its longest cycles. Results of Jackson, and Jackson and Wormald, imply that the circumference of a 3-connected cubic n-vertex graph i...
CAAN
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Random graphs with given expected degrees G(w) were introduced by Chung and Lu so as to extend the theory of classical G(n, p) random graphs to include random power law g...