721 search results - page 3 / 145 » Graphs with Large Obstacle Numbers |
ICCAD
1999
IEEE
13 years 10 months ago
1999
IEEE
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
JGT
2007
13 years 5 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...
COCOON
2009
Springer
14 years 11 days ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
ICNP
2005
IEEE
13 years 11 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
DM
2000
13 years 5 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple