270 search results - page 53 / 54 » Diameter bounds for planar graphs |
DCG
2007
13 years 6 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
COMPGEOM
2010
ACM
13 years 11 months ago
2010
ACM
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive va...
IWDC
2005
Springer
13 years 11 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
ICALP
2005
Springer
13 years 12 months ago
2005
Springer
A class of relational structures is said to have the extension preservation property if every first-order sentence that is preserved under extensions on the class is equivalent t...
APPROX
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...