DocumentCode :
2722485
Title :
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
Author :
Wulff-Nilsen, Christian
Author_Institution :
Dept. of Math. & Comput. Sci., Univ. of Southern Denmark, Odense, Denmark
fYear :
2011
fDate :
22-25 Oct. 2011
Firstpage :
37
Lastpage :
46
Abstract :
Alon, Seymour, and Thomas generalized Lipton and Tarjan´s planar separator theorem and showed that a Kh- minor free graph with n vertices has a separator of size at most h3/2 √n. They gave an algorithm that, given a graph G with m edges and n vertices and given an integer h ≥ 1, outputs in O(√hnm) time such a separator or a Ku-minor of G. Plotkin, Rao, and Smith gave an O(hm√/n log n) time algorithm to find a separator of size O(h√n log n). Kawarabayashi and Reed improved the bound on the size of the separator to h√n and gave an algorithm that finds such a separator in O(n1+ϵ) time for any constant ϵ >; 0, assuming h is constant. This algorithm has an extremely large dependency on h in the running time (some power tower of h whose height is itself a function of h), making it impractical even for small h. We are interested in a small polynomial time dependency on h and we show how to find an O (h√n log n)-size separator or report that G has a Ku-minor in O(poly(h)n5/4+ϵ) time for any constant ϵ >; 0. We also present the first O(poly(h)n) time algorithm to find a separator of size 0(nc) for a constant ϵ <; 1. As corollaries of our results, we get improved algorithms for shortest paths and maximum matching. Furthermore, for integers ℓ and h, we give an O(m ,2 + ϵ /ℓ) time algorithm that either produces a Kh-minor of depth O(ℓ log n) or a separator of size at most O(n/ℓ + ℓh2log n). This improves the shallow minor algorithm of Plotkin, Rao, and Smith when m = Ω(n1+ϵ). We get a similar running time improvement for an approximation algorithm for the problem of finding a largest Kh -minor in a given graph.
Keywords :
computational complexity; graph theory; polynomials; Ku-minor; approximation algorithm; polynomial time dependency; separator theorems; shallow minor free graphs; time algorithm; Algorithm design and analysis; Approximation algorithms; Approximation methods; Clustering algorithms; Heuristic algorithms; Particle separators; Partitioning algorithms; maximum matching; minor-free graph; separator; shallow minor-free graph; shortest path;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on
Conference_Location :
Palm Springs, CA
ISSN :
0272-5428
Print_ISBN :
978-1-4577-1843-4
Type :
conf
DOI :
10.1109/FOCS.2011.15
Filename :
6108148
Link To Document :
بازگشت