Sciweavers

IPL
2007
81views more  IPL 2007»
13 years 4 months ago
Linear-time algorithms for problems on planar graphs with fixed disk dimension
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
Faisal N. Abu-Khzam, Michael A. Langston