2283 search results - page 89 / 457 » Bounds of Graph Characteristics |
168
click to vote
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
132
click to vote
JGAA
2006
15 years 3 months ago
2006
We consider the problem of constructing a minimal cycle-breaking set of turns for a given undirected graph. This problem is important for deadlock-free wormhole routing in compute...
102
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
121
Voted
MFCS
2007
Springer
15 years 9 months ago
2007
Springer
We resolve the computational complexity of determining the treelength of a graph, thereby solving an open problem of Dourisboure and Gavoille, who introduced this parameter, and a...
157
click to vote
COMBINATORICA
2010
14 years 10 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...