Sparse cuts, matching-cuts and leafy trees in graphs

In this thesis, three di®erent graph concepts are studied. A graph (V;E) consists of a set of vertices V and a set of edges E. Graphs are often used as a model for telecommunication networks, where the nodes of the network are represented by the vertices, and an edge is present between two vertices if the corresponding nodes are joined by a direct connection in the network. The two vertices joined by an edge are called its end vertices, and these two vertices are neighbors of each other. The degree of a vertex is its number of neighbors. The problems in this thesis can be explained and motivated using applications in the area of network design and analysis.

[1]  Gerhard J. Woeginger,et al.  A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves , 2003, MFCS.

[2]  Augustine M. Moshi.  Matching cutsets in graphs , 1989, J. Graph Theory.

[3]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[4]  Wen-Lian Hsu,et al.  Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs , 1999, SIAM J. Comput..

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

[6]  Hans L. Bodlaender.  A linear time algorithm for finding tree-decompositions of small treewidth , 1993, STOC '93.

[7]  Ronald L. Graham,et al.  ON PRIMITIVE GRAPHS AND OPTIMAL VERTEX ASSIGNMENTS , 1970 .

[8]  Derek G. Corneil,et al.  A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs , 2004, Discret. Appl. Math..

[9]  Arthur M. Farley,et al.  Networks immune to isolated line failures , 1982, Networks.

[10]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[11]  Jerrold R. Griggs,et al.  Spanning trees in graphs of minimum degree 4 or 5 , 1992, Discret. Math..

[12]  Hans L. Bodlaender,et al.  On Linear Time Minor Tests with Depth-First Search , 1993, J. Algorithms.

[13]  Raphael Yuster,et al.  Connected Domination and Spanning Trees with Many Leaves , 2000, SIAM J. Discret. Math..

[14]  Noga Alon,et al.  Transversal numbers of uniform hypergraphs , 1990, Graphs Comb..

[15]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[16]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

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

[18]  Van Bang Le,et al.  On Stable Cutsets in Line Graphs , 2001, WG.

[19]  Abdel Elah Al-Ayyoub,et al.  The Cross Product of Interconnection Networks , 1997, IEEE Trans. Parallel Distributed Syst..

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

[21]  Tim Nieberg,et al.  Independent and dominating sets in wireless communication graphs , 2006 .

[22]  Sandra Mitchell Hedetniemi,et al.  Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs , 1979, Inf. Process. Lett..

[23]  I. Z. Bouwer,et al.  A Note on Primitive Graphs , 1972, Canadian Mathematical Bulletin.

[24]  Francesco Maffioli,et al.  A Short Note on the Approximability of the Maximum Leaves Spanning Tree Problem , 1994, Inf. Process. Lett..

[25]  Hans L. Bodlaender,et al.  A Tourist Guide through Treewidth , 1993, Acta Cybern..

[26]  Yuval Rabani,et al.  An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm , 1998, SIAM J. Comput..

[27]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.

[28]  Jeremy P. Spinrad,et al.  Forbidden subgraph decomposition , 2002, Discret. Math..

[29]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[30]  Paul S. Bonsma,et al.  Sparsest cuts and concurrent flows in product graphs , 2004, Discret. Appl. Math..

[31]  R. Ravi,et al.  Approximating Maximum Leaf Spanning Trees in Almost Linear Time , 1998, J. Algorithms.

[32]  Satish Rao,et al.  Expander flows, geometric embeddings and graph partitioning , 2004, STOC '04.

[33]  Maurizio Patrignani,et al.  The Complexity of the Matching-Cut Problem , 2001, WG.

[34]  D. W. Matula.  Concurrent flow and concurrent connectivity on graphs , 1985 .

[35]  R. Downey,et al.  Parameterized Computational Feasibility , 1995 .

[36]  Feodor F. Dragan,et al.  On stable cutsets in graphs , 2000, Discret. Appl. Math..

[37]  Farhad Shahrokhi,et al.  Sparsest cuts and bottlenecks in graphs , 1990, Discret. Appl. Math..

[38]  Daniel J. Kleitman,et al.  Spanning trees with many leaves in cubic graphs , 1989, J. Graph Theory.

[39]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[40]  Vasek Chvátal,et al.  Recognizing decomposable graphs , 1984, J. Graph Theory.

[41]  Abdelghani Bellaachia,et al.  Communication capabilities of product networks , 2000, Telecommun. Syst..

[42]  Francesco Maffioli,et al.  On the Approximability of Some Maximum Spanning Tree Problems , 1995, Theor. Comput. Sci..

[43]  Paul D. Seymour,et al.  Spanning trees with many leaves , 2001, J. Graph Theory.

[44]  Michael R. Fellows,et al.  FPT is P-Time Extremal Structure I , 2005, ACiD.