26 search results - page 6 / 6 » Computing Radial Drawings on the Minimum Number of Circles |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...