159 search results - page 7 / 32 » Undirected Graphs of Entanglement 2 |
102
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
110
click to vote
COMBINATORICA
1998
14 years 11 months ago
1998
For an undirected graph G = (V, E), let Gn denote the graph whose vertex set is V n in which two distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff ...
91
Voted
JCO
2007
14 years 11 months ago
2007
Abstract The wide diameter of a graph is an important parameter to measure faulttolerance of interconnection network. This paper proves that for any two vertices in de Bruijn undir...
137
Voted
ESA
2007
Springer
15 years 5 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
103
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give a deterministic algorithm to find the minimum cut in a surface-embedded graph in near-linear time. Given an undirected graph embedded on an orientable surface of genus g,...