28 search results - page 4 / 6 » Counting Plane Graphs: Flippability and its Applications |
152
click to vote
COMPGEOM
2010
ACM
15 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...
139
click to vote
PATMOS
2004
Springer
15 years 11 months ago
2004
Springer
Motivated by very/ultra large scale integrated circuit (VLSI/ULSI) physical design applications, we study the construction of rectilinear minimum spanning tree (RMST) with its maxi...
181
click to vote
ALGOSENSORS
2004
Springer
15 years 11 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
172
click to vote
STACS
2007
Springer
16 years 1 days ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
186
click to vote
WADS
2009
Springer
16 years 15 days ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...