2 search results - page 1 / 1 » A note on isosceles planar graph drawing |
62
Voted
IPL
2010
14 years 8 months ago
2010
81
Voted
FOCS
2009
IEEE
15 years 4 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...