1633 search results - page 104 / 327 » Planar Map Graphs |
112
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
166
Voted
GD
2004
Springer
15 years 7 months ago
2004
Springer
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...
125
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
145
click to vote
ISAAC
2010
Springer
15 years 9 days ago
2010
Springer
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
124
Voted
GD
2003
Springer
15 years 7 months ago
2003
Springer
Hex is a classic board game for two players. There exists an intuitive mapping of the state of a hex game onto a graph. The motivation of the work presented in this paper was to cr...