1729 search results - page 79 / 346 » Bound Graph Polysemy |
174
click to vote
JGAA
2006
15 years 6 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...
141
click to vote
STOC
2001
ACM
16 years 6 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...
158
click to vote
MFCS
2007
Springer
16 years 9 days 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...
213
click to vote
COMBINATORICA
2010
15 years 1 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...
173
click to vote
GD
2000
Springer
15 years 9 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...