208 search results - page 14 / 42 » Improved upper bounds on the crossing number |
TPDS
2010
13 years 5 months ago
2010
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
ISAAC
2005
Springer
14 years 27 days ago
2005
Springer
In an orthogonal drawing of a planar graph G, each vertex is drawn as a point, each edge is drawn as a sequence of alternate horizontal and vertical line segments, and any two edge...
APN
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. Symbolic techniques based on BDDs (Binary Decision Diagrams) have emerged as an e cient strategy for the analysis of Petri nets. The existing techniques for the symbolic ...
CCCG
2007
13 years 8 months ago
2007
Given a convex polyhedron with n vertices and F faces, what is the fewest number of pieces, each of which unfolds to a simple polygon, into which it may be cut by slices along edg...
SWAT
2010
Springer
14 years 13 days ago
2010
Springer
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...