Topics in Graph Algorithms: Structural Results and Algorithmic Techniques

Coping with computational intractability has inspired the development of a variety of algorithmic techniques. The main challenge has usually been the design of polynomial time algorithms for NP -complete problems in a way that guarantees some, often worst-case, satisfactory performance when compared to exact (optimal) solutions. We mainly study some emergent techniques that help to bridge the gap between computational intractability and practicality. We present results that lead to better exact and approximation algorithms and better implementations. The problems considered in this dissertation share much in common structurally, and have applications in several scientific domains, including circuit design, network reliability, and bioinformatics. We begin by considering the relationship between graph coloring and the immersion order, a well-quasi-order defined on the set of finite graphs. We establish several (structural) results and discuss their potential algorithmic consequences. We discuss graph metrics such as treewidth and pathwidth. Treewidth is well studied, mainly because many problems that are NP -hard in general have polynomial time algorithms when restricted to graphs of bounded treewidth. Pathwidth has many applications ranging from circuit layout to natural language processing. We present a linear time algorithm to approximate the pathwidth of planar graphs that have a fixed disk dimension. We consider the face cover problem, which has potential applications in facilities location and logistics. Being fixed-parameter tractable, we develop an algorithm that solves it in time O(5 + n) where k is the input parameter. This is a notable improvement over the previous best known algorithm, which runs in O(8n).

[1]  Paul Erdös,et al.  On the conjecture of hajós , 1981, Comb..

[2]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[3]  Robin Thomas,et al.  Hadwiger's conjecture forK6-free graphs , 1993, Comb..

[4]  Michael A. Langston,et al.  Approximation the Pathwidth of Outerplanar Graphs , 1998, Inf. Process. Lett..

[5]  Rolf Niedermeier,et al.  Refined Search Tree Technique for DOMINATING SET on Planar Graphs , 2001, MFCS.

[6]  Fedor V. Fomin,et al.  Approximation of pathwidth of outerplanar graphs , 2002, J. Algorithms.

[7]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[8]  Ton Kloks,et al.  Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs , 1993, J. Algorithms.

[9]  P. Duchet,et al.  On Hadwiger''s number and stability number , 1982 .

[10]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[11]  Eugene L. Lawler,et al.  A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[12]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[13]  Michael A. Langston,et al.  Fast algorithms for K4 immersion testing , 1999 .

[14]  Wolfgang Mader,et al.  3n − 5 Edges Do Force a Subdivision of , 1998, Comb..

[15]  Andre E. Kezdy,et al.  An Algorithm to Find a K5 Minor , 1991 .

[16]  B. Bollobás,et al.  Extremal Graph Theory , 2013 .

[17]  Konstantin Skodinis.  Computing Optimal Linear Layouts of Trees in Linear Time , 2000, ESA.

[18]  K. Wagner.  Über eine Eigenschaft der ebenen Komplexe , 1937 .

[19]  Hans L. Bodlaender,et al.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC.

[20]  Michael R. Fellows,et al.  Nonconstructive tools for proving polynomial-time decidability , 1988, JACM.

[21]  Samir Khuller.  The vertex cover problem , 2002 .

[22]  Rolf Niedermeier,et al.  A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..

[23]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[24]  Michael R. Fellows,et al.  Nonconstructive Advances in Polynomial-Time Complexity , 1987, Inf. Process. Lett..

[25]  D. West.  Introduction to Graph Theory , 1995 .

[26]  Michael J. Dinneen,et al.  A Characterization of Graphs with Vertex Cover up to Five , 1994, ORDAL.

[27]  D. Bienstock,et al.  Algorithmic Implications of the Graph Minor Theorem , 1995 .

[28]  Michael R. Fellows,et al.  Coordinatized Kernels and Catalytic Reductions: An Improved FPT Algorithm for Max Leaf Spanning Tree and Other Problems , 2000, FSTTCS.

[29]  David Eppstein.  Diameter and Treewidth in Minor-Closed Graph Families , 2000, Algorithmica.

[30]  A. Kempe.  How to Colour a Map with Four Colours , 1880, Nature.

[31]  K. Wagner.  Beweis einer Abschwächung der Hadwiger-Vermutung , 1964 .

[32]  Bjarne Toft,et al.  On critical subgraphs of colour-critical graphs , 1974, Discret. Math..

[33]  R. Battiti,et al.  Covering Trains by Stations or the Power of Data Reduction , 1998 .

[34]  Takao Nishizeki,et al.  Planar Graphs: Theory and Algorithms , 1988 .

[35]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

[36]  W. Mader.  Homomorphiesätze für Graphen , 1968 .

[37]  Ivan Hal Sudborough,et al.  Min Cut is NP-Complete for Edge Weigthed Trees , 1986, ICALP.

[38]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[39]  Michael R. Fellows,et al.  On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..

[40]  B. Toft.  Colouring, stable sets and perfect graphs , 1996 .

[41]  Weijia Jia,et al.  Vertex Cover: Further Observations and Further Improvements , 2001, J. Algorithms.

[42]  Michael A. Langston,et al.  A Practical Approach to Layout Optimization , 1993, The Sixth International Conference on VLSI Design.

[43]  Bjarne Toft.  On separating sets of edges in contraction-critical graphs , 1972 .

[44]  Michael A. Langston,et al.  On algorithmic applications of the immersion order : An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory , 1998, Discret. Math..

[45]  Small Maximal Independent Sets and Faster Exact Graph Coloring , 2003 .

[46]  Rolf Niedermeier,et al.  Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs , 2002, Algorithmica.

[47]  Clyde L. Monma,et al.  On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..

[48]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[49]  G. Dirac.  A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs , 1952 .

[50]  Hassler Whitney,et al.  Kempe Chains and the Four Colour Problem , 1992 .

[51]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[52]  C. Kuratowski.  Sur le problème des courbes gauches en Topologie , 1930 .

[53]  Ulrike Stege,et al.  Solving large FPT problems on coarse-grained parallel machines , 2003, J. Comput. Syst. Sci..