DOCSLIB.ORG

Advanced Graph Theoretical Topics 1 Subsets, Decompositions, and Intersections

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Advanced Graph Theoretical Topics Delp ensum I238 - Institutt for informatikk Pinar Heggernes August 23, 2001 Many graph problems that are NP-complete on general graphs, have p oly- nomial time solutions for sp ecial graph classes. In this do cument, a number of such graph classes are reviewed. In addition, some imp ortant graph theoretical de nitions and notions are mentioned and explained. 1 Subsets, decomp ositions, and intersections De nition 1.1 Given a graph G =(V; E) and a subset U V , the subgraph of G induced by U is the graph G[U ]= (U; D ), where (u; v ) 2 D if and only if u; v 2 U and (u; v ) 2 E . De nition 1.2 A tree-decomp osition of a graph G =(V; E) is a pair (fX j i 2 I g ; T =(I; M )) i where fX j i 2 I g isacol lection of subsets of V , and T isatree, such that: i S X = V i i2I (u; v ) 2 E )9i 2 I with u; v 2 X i For al l vertices v 2 V , fi 2 I j v 2 X g induces a connected subtreeof T . i The last condition of De nition 1.2 can b e replaced by the following equiv- alent condition: i; k ; j 2 I and j is on the path from i to k in T ) X \ X X . i k j Lemma 1.3 [6] Let (fX j i 2 I g ; T =(I; M )) be a tree decomposition of i G =(V; E), and let K V be a clique in G. Then there exists an i 2 I with K X . i The width of a decomp osition (fX j i 2 I g ; T =(I; M )) is max jX j1. i i2I i The treewidth of a graph G is the minimum width over all tree-decomp ositions of G. 1 Corollary 1.4 The treewidth of a graph G is at least one less than the size of the largest clique in G. A path-decomposition is a tree-decomp osition (fX j i 2 I g ; T =(I; M )) i such that T is a path. The pathwidth of a graph G is the minimum width over all path-decomp ositions of G. Example 1.5 Let G be the graph shown in Figure 1 a). Let I = f1; 2; 3; 4g;X = fa; b; f g;X = fb; d; f g;X = fb; c; dg;X = 1 2 3 4 fd; e; f g. Let T be the tree shown in Figure 1 b). (fX j i 2 I g;T) is a tree- i decomposition of G. Let J = f1; 2; 3g;Y = fa; b; f g;Y = fb; c; e; f g;Y = fc; d; eg. Let P be the 1 2 3 path shown in Figure1c). (fY j j 2 J g;P) is a path-decomposition of G. j a 1 1 b f 2 2 c e 3 4 d 3 a) b) c) Figure 1: The graphs of Example 1.5. The graph G of Example 1.5 has treewidth 2 and pathwidth 2 (why?). Since every path decomp osition is also a tree decomp osition, pathwidth treewidth for all graphs. Theorem 1.6 [1] The fol lowing problems are NP-complete: Given a graph G = (V; E) and an integer c < jV j, is the treewidth of G c? Given a graph G = (V; E) and an integer c < jV j, is the pathwidth of G c? The c-treewidth problem can b e solved in p olynomial time [1]: Given a graph G, is the treewidth of G at most c? In this case, c is a constant and not a part of the input. We end this section with the de nition of a minimal separator, which is central in coming sections. Given a graph G =(V; E), a set of vertices S V is a separator if the subgraph of G induced by V S is disconnected. The set S is a uv -separator if u and v are in di erent connected comp onents of G[V S ]. A uv -separator S is minimal if no subset of S separates u and v . 2 De nition 1.7 S is a minimal separator of G if there exist two vertices u and v in G such that S is a minimal uv -separator. 2 Partial k -trees De nition 2.1 The class of k -trees is de nedrecursively as fol lows: The complete graph on k vertices i a k -tree. A k -tree G with n +1 vertices (n k )can beconstructedfrom a k -tree H with n vertices by adding a vertex adjacent to exactly k vertices, namely al l vertices of a k -clique of H . The following theorem gives several alternativecharacterizations of k -trees. Theorem 2.2 [15] Let G = (V; E) be a graph. The fol lowing statements are equivalent: G is a k -tree. G is connected, G has a k -clique, but no (k +2)-cliques, and every minimal separator of G is a k -clique. 1 k (k +1), and every minimal separator of G is connected, jE j = k jV j 2 G is a k -clique. G has a k -clique, but not a (k +2)-clique, and every minimal separator of G is a clique, and for al l distinct non-adjacent pairs of vertices x; y 2 V , there exist exactly k vertex disjoint paths from x to y . De nition 2.3 A partial k -tree is a graph that contains al l the vertices and a subset of the edges of a k -tree. Theorem 2.4 [17] G isapartial k -tree if and only if G has treewidth at most k . Pro of. ): Let G b e a partial k -tree. We can assume that G is a k -tree since the treewidth cannot increase for subgraphs. Let thus G =(V; E) be a k -tree with jV j >k+1. There is avertex v 2 V such that G[V fv g] is a k -tree, and the neighb ors of v induce a clique K of size k in G. Using induction, we can assume that G[V fv g] has treewidth at most k with a corresp onding tree decomp osition (fX j i 2 I g;T =(I; M )). (The base case of induction is when i G[V fv g] is a complete graph on k vertices; such a graph has clearly treewidth 0 0 containing all neighb ors of v k 1.) By Lemma 1.3, there is an i 2 I with X i 0 in G, with K X . Let J = I [fj g, where j 62 I , and let X = K [fv g. Now, i j 0 (fX j i 2 J g;T =(J;M [fi ;jg)) is a tree decomp osition of G with width k . i (: Let G =(V; E) b e a graph with jV j >k+1,andlet(fX j i 2 I g;T = i (I; M )) b e a tree decomp osition of G of width at most k . Wewillprove, with 3 0 induction on jV j, that there is a k -tree H =(V; E )such that for every i 2 I , G[X ] is a subgraph of a clique of H with k +1 vertices. If jV j = k + 1 then we i are done. Otherwise, take a leaf no de l 2 I and let j 2 I b e the only neighbor of l 2 T . If X X , then we can remove l from T and continue with the l j remaining tree decomp osition. Let v b e the only vertex in X X (otherwise l j X can b e divided into several tree no des such that the resulting new leaf no de l satis es this requirement). Note that v do es not app ear in any X for i 6= l . i Thus all neighb ors of v must app ear in X . Remember that jX jk +1,thus v l l has at most k neighb ors. Supp ose that the induction hyp othesis on G[V fv g] 0 with tree decomp osition (fX gji 2 I; i 6= l g;T[I fl g]) results in a k -tree H . i Since v 62 X , all neighb ors of v must b elong to X . Therefore, the neighb ors of j j 0 v induce a subgraph of a k -clique C of H in G. Now, we can add v with edges 0 to all vertices of C to H (whichwillmakea (k + 1)-clique), and get the desired k -tree H . 2 Several problems that are NP-complete on general graphs have p olynomial time algorithms for partial k -trees. We will lo ok at one such example, INDE- PENDENT SET [5]. In this problem we are lo oking for the maximum size of a set X V in a graph G =(V; E)such thatnotwovertices b elonging to X are neighbors in G. Given a tree decomp osition of G, it is easy to make one that is binary with the same treewidth. Supp ose that we have a binary tree decomp osition (fX j i 2 I g;T =(I; M )) of input graph G, with ro ot r and treewidth k . For i each i 2 I , let Y = fv 2 X j j = i or j is a descendantof ig.
Recommended publications
  • On Treewidth and Graph Minors

    On Treewidth and Graph Minors

    On Treewidth and Graph Minors Daniel John Harvey Submitted in total fulfilment of the requirements of the degree of Doctor of Philosophy February 2014 Department of Mathematics and Statistics The University of Melbourne Produced on archival quality paper ii Abstract Both treewidth and the Hadwiger number are key graph parameters in structural and al- gorithmic graph theory, especially in the theory of graph minors. For example, treewidth demarcates the two major cases of the Robertson and Seymour proof of Wagner's Con- jecture. Also, the Hadwiger number is the key measure of the structural complexity of a graph. In this thesis, we shall investigate these parameters on some interesting classes of graphs. The treewidth of a graph defines, in some sense, how \tree-like" the graph is. Treewidth is a key parameter in the algorithmic field of fixed-parameter tractability. In particular, on classes of bounded treewidth, certain NP-Hard problems can be solved in polynomial time. In structural graph theory, treewidth is of key interest due to its part in the stronger form of Robertson and Seymour's Graph Minor Structure Theorem. A key fact is that the treewidth of a graph is tied to the size of its largest grid minor. In fact, treewidth is tied to a large number of other graph structural parameters, which this thesis thoroughly investigates. In doing so, some of the tying functions between these results are improved. This thesis also determines exactly the treewidth of the line graph of a complete graph. This is a critical example in a recent paper of Marx, and improves on a recent result by Grohe and Marx.
  • Lecture 10: April 20, 2005 Perfect Graphs

    Lecture 10: April 20, 2005 Perfect Graphs

    Re-revised notes 4-22-2005 10pm CMSC 27400-1/37200-1 Combinatorics and Probability Spring 2005 Lecture 10: April 20, 2005 Instructor: L´aszl´oBabai Scribe: Raghav Kulkarni TA SCHEDULE: TA sessions are held in Ryerson-255, Monday, Tuesday and Thursday 5:30{6:30pm. INSTRUCTOR'S EMAIL: [email protected] TA's EMAIL: [email protected], [email protected] IMPORTANT: Take-home test Friday, April 29, due Monday, May 2, before class. Perfect Graphs k 1=k Shannon capacity of a graph G is: Θ(G) := limk (α(G )) : !1 Exercise 10.1 Show that α(G) χ(G): (G is the complement of G:) ≤ Exercise 10.2 Show that χ(G H) χ(G)χ(H): · ≤ Exercise 10.3 Show that Θ(G) χ(G): ≤ So, α(G) Θ(G) χ(G): ≤ ≤ Definition: G is perfect if for all induced sugraphs H of G, α(H) = χ(H); i. e., the chromatic number is equal to the clique number. Theorem 10.4 (Lov´asz) G is perfect iff G is perfect. (This was open under the name \weak perfect graph conjecture.") Corollary 10.5 If G is perfect then Θ(G) = α(G) = χ(G): Exercise 10.6 (a) Kn is perfect. (b) All bipartite graphs are perfect. Exercise 10.7 Prove: If G is bipartite then G is perfect. Do not use Lov´asz'sTheorem (Theorem 10.4). 1 Lecture 10: April 20, 2005 2 The smallest imperfect (not perfect) graph is C5 : α(C5) = 2; χ(C5) = 3: For k 2, C2k+1 imperfect.
  • Mutant Knots and Intersection Graphs 1 Introduction

    Mutant Knots and Intersection Graphs 1 Introduction

    Mutant knots and intersection graphs S. V. CHMUTOV S. K. LANDO We prove that if a finite order knot invariant does not distinguish mutant knots, then the corresponding weight system depends on the intersection graph of a chord diagram rather than on the diagram itself. Conversely, if we have a weight system depending only on the intersection graphs of chord diagrams, then the composition of such a weight system with the Kontsevich invariant determines a knot invariant that does not distinguish mutant knots. Thus, an equivalence between finite order invariants not distinguishing mutants and weight systems depending on intersections graphs only is established. We discuss relationship between our results and certain Lie algebra weight systems. 57M15; 57M25 1 Introduction Below, we use standard notions of the theory of finite order, or Vassiliev, invariants of knots in 3-space; their definitions can be found, for example, in [6] or [14], and we recall them briefly in Section 2. All knots are assumed to be oriented. Two knots are said to be mutant if they differ by a rotation of a tangle with four endpoints about either a vertical axis, or a horizontal axis, or an axis perpendicular to the paper. If necessary, the orientation inside the tangle may be replaced by the opposite one. Here is a famous example of mutant knots, the Conway (11n34) knot C of genus 3, and Kinoshita–Terasaka (11n42) knot KT of genus 2 (see [1]). C = KT = Note that the change of the orientation of a knot can be achieved by a mutation in the complement to a trivial tangle.
  • Arxiv:2106.16130V1 [Math.CO] 30 Jun 2021 in the Special Case of Cyclohedra, and by Cardinal, Langerman and P´Erez-Lantero [5] in the Special Case of Tree Associahedra

    Arxiv:2106.16130V1 [Math.CO] 30 Jun 2021 in the Special Case of Cyclohedra, and by Cardinal, Langerman and P´Erez-Lantero [5] in the Special Case of Tree Associahedra

    LAGOS 2021 Bounds on the Diameter of Graph Associahedra Jean Cardinal1;4 Universit´elibre de Bruxelles (ULB) Lionel Pournin2;4 Mario Valencia-Pabon3;4 LIPN, Universit´eSorbonne Paris Nord Abstract Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph G encodes the combinatorics of search trees on G, defined recursively by a root r together with search trees on each of the connected components of G − r. In particular, the skeleton of the graph associahedron is the rotation graph of those search trees. We investigate the diameter of graph associahedra as a function of some graph parameters. It is known that the diameter of the associahedra of paths of length n, the classical associahedra, is 2n − 6 for a large enough n. We give a tight bound of Θ(m) on the diameter of trivially perfect graph associahedra on m edges. We consider the maximum diameter of associahedra of graphs on n vertices and of given tree-depth, treewidth, or pathwidth, and give lower and upper bounds as a function of these parameters. Finally, we prove that the maximum diameter of associahedra of graphs of pathwidth two is Θ(n log n). Keywords: generalized permutohedra, graph associahedra, tree-depth, treewidth, pathwidth 1 Introduction The vertices and edges of a polyhedron form a graph whose diameter (often referred to as the diameter of the polyhedron for short) is related to a number of computational problems. For instance, the question of how large the diameter of a polyhedron arises naturally from the study of linear programming and the simplex algorithm (see, for instance [27] and references therein).
  • Symmetry and Structure of Graphs

    Symmetry and Structure of Graphs

    Symmetry and Structure of graphs by Kovács Máté Submitted to Central European University Department of Department of Mathematics and its Applications In partial fulfillment of the requirements for the degree of Master of Science Supervisor: Dr. Hegedus˝ Pál CEU eTD Collection Budapest, Hungary 2014 I, the undersigned [Kovács Máté], candidate for the degree of Master of Science at the Central European University Department of Mathematics and its Applications, declare herewith that the present thesis is exclusively my own work, based on my research and only such external information as properly credited in notes and bibliography. I declare that no unidentified and illegitimate use was made of work of others, and no part the thesis infringes on any person’s or institution’s copyright. I also declare that no part the thesis has been submitted in this form to any other institution of higher education for an academic degree. Budapest, 9 May 2014 ————————————————— Signature CEU eTD Collection c by Kovács Máté, 2014 All Rights Reserved. ii Abstract The thesis surveys results on structure and symmetry of graphs. Structure and symmetry of graphs can be handled by graph homomorphisms and graph automorphisms - the two approaches are compatible. Two graphs are called homomorphically equivalent if there is a graph homomorphism between the two graphs back and forth. Being homomorphically equivalent is an equivalence relation, and every class has a vertex minimal element called the graph core. It turns out that transitive graphs have transitive cores. The possibility of a structural result regarding transitive graphs is investigated. We speculate that almost all transitive graphs are cores.
  • Interval Completion with Few Edges∗

    Interval Completion with Few Edges∗

    Interval Completion with Few Edges∗ Pinar Heggernes Christophe Paul Department of Informatics CNRS - LIRMM, and University of Bergen School of Computer Science Norway McGill Univ. Canada [email protected] [email protected] Jan Arne Telle Yngve Villanger Department of Informatics Department of Informatics University of Bergen University of Bergen Norway Norway [email protected] [email protected] ABSTRACT Keywords We present an algorithm with runtime O(k2kn3m) for the Interval graphs, physical mapping, profile minimization, following NP-complete problem [8, problem GT35]: Given edge completion, FPT algorithm, branching an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 6, 24, 1. INTRODUCTION AND MOTIVATION 13], first posed by Kaplan, Shamir and Tarjan, of whether Interval graphs are the intersection graphs of intervals of this problem could be solved in time f(k) nO(1). The prob- the real line and have a wide range of applications [12]. lem has applications in Physical Mapping· of DNA [11] and Connected with interval graphs is the following problem: in Profile Minimization for Sparse Matrix Computations [9, Given an arbitrary graph G, what is the minimum number 25]. For the first application, our results show tractability of edges that must be added to G in order to obtain an in- for the case of a small number k of false negative errors, and terval graph? This problem is NP-hard [18, 8] and it arises for the second, a small number k of zero elements in the in both Physical Mapping of DNA and Sparse Matrix Com- envelope.
  • Vertex Deletion Problems on Chordal Graphs∗†

    Vertex Deletion Problems on Chordal Graphs∗†

    Vertex Deletion Problems on Chordal Graphs∗† Yixin Cao1, Yuping Ke2, Yota Otachi3, and Jie You4 1 Department of Computing, Hong Kong Polytechnic University, Hong Kong, China [email protected] 2 Department of Computing, Hong Kong Polytechnic University, Hong Kong, China [email protected] 3 Faculty of Advanced Science and Technology, Kumamoto University, Kumamoto, Japan [email protected] 4 School of Information Science and Engineering, Central South University and Department of Computing, Hong Kong Polytechnic University, Hong Kong, China [email protected] Abstract Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis and Yan- nakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special. This paper initiates a systematic study of vertex deletion problems from one subclass of chordal graphs to another. We give polynomial-time algorithms or proofs of NP-completeness for most of the problems. In particular, we show that the vertex deletion problem from chordal graphs to interval graphs is NP-complete. 1998 ACM Subject Classification F.2.2 Analysis of Algorithms and Problem Complexity, G.2.2 Graph Theory Keywords and phrases vertex deletion problem, maximum subgraph, chordal graph, (unit) in- terval graph, split graph, hereditary property, NP-complete, polynomial-time algorithm Digital Object Identifier 10.4230/LIPIcs.FSTTCS.2017.22 1 Introduction Generally speaking, a vertex deletion problem asks to transform an input graph to a graph in a certain class by deleting a minimum number of vertices.
  • A Comparison of Two Approaches for Polynomial Time Algorithms

    A Comparison of Two Approaches for Polynomial Time Algorithms

    A comparison of two approaches for polynomial time algorithms computing basic graph parameters∗† Frank Gurski‡ March 26, 2018 Abstract In this paper we compare and illustrate the algorithmic use of graphs of bounded tree- width and graphs of bounded clique-width. For this purpose we give polynomial time algorithms for computing the four basic graph parameters independence number, clique number, chromatic number, and clique covering number on a given tree structure of graphs of bounded tree-width and graphs of bounded clique-width in polynomial time. We also present linear time algorithms for computing the latter four basic graph parameters on trees, i.e. graphs of tree-width 1, and on co-graphs, i.e. graphs of clique-width at most 2. Keywords:graph algorithms, graph parameters, clique-width, NLC-width, tree-width 1 Introduction A graph parameter is a mapping that associates every graph with a positive integer. Well known graph parameters are independence number, dominating number, and chromatic num- ber. In general the computation of such parameters for some given graph is NP-hard. In this work we give fixed-parameter tractable (fpt) algorithms for computing basic graph parameters restricted to graph classes of bounded tree-width and graph classes of bounded clique-width. The tree-width of graphs has been defined in 1976 by Halin [Hal76] and independently in arXiv:0806.4073v1 [cs.DS] 25 Jun 2008 1986 by Robertson and Seymour [RS86] by the existence of a tree decomposition. Intuitively, the tree-width of some graph G measures how far G differs from a tree. Two more powerful and more recent graph parameters are clique-width1 and NLC-width2 both defined in 1994, by Courcelle and Olariu [CO00] and by Wanke [Wan94], respectively.
  • A Subexponential Parameterized Algorithm for Proper Interval Completion

    A Subexponential Parameterized Algorithm for Proper Interval Completion

    A subexponential parameterized algorithm for Proper Interval Completion Ivan Bliznets1 Fedor V. Fomin2 Marcin Pilipczuk2 Micha l Pilipczuk2 1St. Petersburg Academic University of the Russian Academy of Sciences, Russia 2Department of Informatics, University of Bergen, Norway ESA'14, Wroc law, September 9th, 2014 Bliznets, Fomin, Pilipczuk×2 SubExp for PIC 1/17 Proper interval graphs: graphs admitting an intersection model of intervals on a line s.t. no interval contains any other interval. Unit interval graphs: graphs admitting an intersection model of unit intervals on a line. PIG = UIG. (Proper) interval graphs Interval graphs: graphs admitting an intersection model of intervals on a line. Bliznets, Fomin, Pilipczuk×2 SubExp for PIC 2/17 Unit interval graphs: graphs admitting an intersection model of unit intervals on a line. PIG = UIG. (Proper) interval graphs Interval graphs: graphs admitting an intersection model of intervals on a line. Proper interval graphs: graphs admitting an intersection model of intervals on a line s.t. no interval contains any other interval. Bliznets, Fomin, Pilipczuk×2 SubExp for PIC 2/17 PIG = UIG. (Proper) interval graphs Interval graphs: graphs admitting an intersection model of intervals on a line. Proper interval graphs: graphs admitting an intersection model of intervals on a line s.t. no interval contains any other interval. Unit interval graphs: graphs admitting an intersection model of unit intervals on a line. Bliznets, Fomin, Pilipczuk×2 SubExp for PIC 2/17 (Proper) interval graphs Interval graphs: graphs admitting an intersection model of intervals on a line. Proper interval graphs: graphs admitting an intersection model of intervals on a line s.t.
  • The Strong Perfect Graph Theorem

    The Strong Perfect Graph Theorem

    Annals of Mathematics, 164 (2006), 51–229 The strong perfect graph theorem ∗ ∗ By Maria Chudnovsky, Neil Robertson, Paul Seymour, * ∗∗∗ and Robin Thomas Abstract A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is an odd cycle of length at least five or the complement of one. The “strong perfect graph conjecture” (Berge, 1961) asserts that a graph is perfect if and only if it is Berge. A stronger conjecture was made recently by Conforti, Cornu´ejols and Vuˇskovi´c — that every Berge graph either falls into one of a few basic classes, or admits one of a few kinds of separation (designed so that a minimum counterexample to Berge’s conjecture cannot have either of these properties). In this paper we prove both of these conjectures. 1. Introduction We begin with definitions of some of our terms which may be nonstandard. All graphs in this paper are finite and simple. The complement G of a graph G has the same vertex set as G, and distinct vertices u, v are adjacent in G just when they are not adjacent in G.Ahole of G is an induced subgraph of G which is a cycle of length at least 4. An antihole of G is an induced subgraph of G whose complement is a hole in G. A graph G is Berge if every hole and antihole of G has even length. A clique in G is a subset X of V (G) such that every two members of X are adjacent.
  • Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

    Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

    Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic, Marina Lipshteyn, Michal Stern To cite this version: Martin Charles Golumbic, Marina Lipshteyn, Michal Stern. Representations of Edge Intersection Graphs of Paths in a Tree. 2005 European Conference on Combinatorics, Graph Theory and Appli- cations (EuroComb ’05), 2005, Berlin, Germany. pp.87-92. hal-01184396 HAL Id: hal-01184396 https://hal.inria.fr/hal-01184396 Submitted on 14 Aug 2015 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. EuroComb 2005 DMTCS proc. AE, 2005, 87–92 Representations of Edge Intersection Graphs of Paths in a Tree Martin Charles Golumbic1,† Marina Lipshteyn1 and Michal Stern1 1Caesarea Rothschild Institute, University of Haifa, Haifa, Israel Let P be a collection of nontrivial simple paths in a tree T . The edge intersection graph of P, denoted by EP T (P), has vertex set that corresponds to the members of P, and two vertices are joined by an edge if the corresponding members of P share a common edge in T . An undirected graph G is called an edge intersection graph of paths in a tree, if G = EP T (P) for some P and T .
  • Computing Directed Path-Width and Directed Tree-Width of Recursively

    Computing Directed Path-Width and Directed Tree-Width of Recursively

    Computing directed path-width and directed tree-width of recursively defined digraphs∗ Frank Gurski1 and Carolin Rehs1 1University of D¨usseldorf, Institute of Computer Science, Algorithmics for Hard Problems Group, 40225 D¨usseldorf, Germany June 13, 2018 Abstract In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint union, order composition, directed union, and series composition of two directed graphs. These results imply the equality of directed path-width and directed tree-width for all digraphs which can be defined by these four operations. This allows us to show a linear-time solution for computing the directed path-width and directed tree-width of all these digraphs. Since directed co-graphs are precisely those digraphs which can be defined by the disjoint union, order composition, and series composition our results imply the equality of directed path-width and directed tree-width for directed co-graphs and also a linear-time solution for computing the directed path-width and directed tree-width of directed co-graphs, which generalizes the known results for undirected co-graphs of Bodlaender and M¨ohring. Keywords: directed path-width; directed tree-width; directed co-graphs 1 Introduction Tree-width is a well-known graph parameter [36]. Many NP-hard graph problems admit poly- nomial-time solutions when restricted to graphs of bounded tree-width using the tree-decom- position [1, 3, 22, 27]. The same holds for path-width [35] since a path-decomposition can be regarded as a special case of a tree-decomposition.