DocumentCode :
1963678
Title :
Planarity Allowing Few Error Vertices in Linear Time
Author :
Kawarabayashi, Ken-ichi
Author_Institution :
Nat. Inst. of Inf., Hitotsubasi, Japan
fYear :
2009
fDate :
25-27 Oct. 2009
Firstpage :
639
Lastpage :
648
Abstract :
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 (we call this class of graphs k-apex), and if this is the case, computes a drawing of the graph in the plane after deleting at most k vertices. In fact, in this case, we shall determine the minimum value l ? k such that after deleting some l vertices, the resulting graph is planar. If this is not the case, then the algorithm gives rise to a minor which is not k-apex and is minimal with this property. This answers the question posed by Cabello and Mohar in 2005, and by Kawarabayashi and Reed (STOC´07), respectively. Note that the case k = 0 is the planarity case. Thus our algorithm can be viewed as a generalization of the seminal result by Hopcroft and Tarjan (J. ACM 1974), which determines if a given graph is planar in linear time. Our algorithm can be also compared to the algorithms by Mohar (STOC´96 and Siam J. Discrete Math 2001) for testing the embeddability of an input graph in a fixed surface in linear time, by Kawarabayashi and Mohar (STOC´08) for testing polyhedral embeddability of an input graph in a fixed surface in linear time, and by Kawarabayashi and Reed (STOC´07) for testing the fixed crossing number in linear time. Note that deciding the genus of k-apex graphs is NP-complete, even for k = 1, as shown by Mohar. Thus k-apex graphs are very different from bounded genus graphs in a sense. In addition, for any fixed c, k, we apply our algorithm to obtain a linear time approximation scheme for weighted TSP, and for minimum weighted c-edge-connected submultigraph, respectively, for k-apex graphs. (In this case, an embedding of a k-apex graph is not given in the input). The first result generalizes the recent planar result by Klein (FOCS´05), while the second result generalizes Czumaj et al. (SODA´04). We also extend several optimization results for planar graphs by Baker (J. ACM. 1994)- and others to k-apex graphs.
Keywords :
approximation theory; computational complexity; graph theory; graphs; set theory; travelling salesman problems; NP-complete problem; bounded genus graphs; error vertices; generalization; k-apex graphs; linear time algorithm; linear time approximation; planar graphs; planarity; polyhedral embeddability; travelling salesman problems; vertex set; Approximation algorithms; Computer errors; Computer science; Feedback; Informatics; Linear approximation; Polynomials; Testing; Tree graphs; Approximation Algorithms; Few errors; Planarity; TSP; linear time;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 2009. FOCS '09. 50th Annual IEEE Symposium on
Conference_Location :
Atlanta, GA
ISSN :
0272-5428
Print_ISBN :
978-1-4244-5116-6
Type :
conf
DOI :
10.1109/FOCS.2009.45
Filename :
5438591
Link To Document :
بازگشت