270 search results - page 21 / 54 » Diameter bounds for planar graphs |
ALGORITHMICA
2011
14 years 4 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
IM
2008
14 years 9 months ago
2008
We analyze the structure of random graphs generated by the geographical threshold model. The model is a generalization of random geometric graphs. Nodes are distributed in space, a...
STACS
2000
Springer
15 years 1 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
GD
2008
Springer
14 years 10 months ago
2008
Springer
A nonplanar graph G is near-planar if it contains an edge e such that G − e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from di...
ICALP
2003
Springer
15 years 2 months ago
2003
Springer
The (k, r)-center problem asks whether an input graph G has ≤ k vertices (called centers) such that every vertex of G is within distance ≤ r from some center. In this paper we ...