643 search results - page 73 / 129 » Supereulerian planar graphs |
CATS
2008
13 years 11 months ago
2008
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
COMBINATORICS
2004
13 years 9 months ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
STOC
1998
ACM
14 years 1 months ago
1998
ACM
We introduce and study a modi ed notion of planarity, in which two regions of a map are considered adjacent when they share any point of their boundaries not an edge, as standard...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Given a planar graph G, we consider drawings of G in the plane where edges are represented by straight line segments (which possibly intersect). Such a drawing is specified by an i...