31 search results - page 4 / 7 » Degree-constrained orientations of embedded graphs |
164
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
153
click to vote
COMBINATORICS
2002
15 years 6 months ago
2002
A map is a graph equipped with a circular order of edges around each vertex. These circular orders represent local planar embeddings. The genus of a map is the minimal genus of an...
195
click to vote
COMPGEOM
2004
ACM
15 years 11 months ago
2004
ACM
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
171
click to vote
GD
2006
Springer
15 years 10 months ago
2006
Springer
The planarization method has proven to be successful in graph drawing. The output, a combinatorial planar embedding of the so-called planarized graph, can be combined with state-o...
162
click to vote
COMPGEOM
2009
ACM
16 years 26 days ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...