DOCSLIB.ORG

Linear Structure of Bipartite Permutation Graphs and the Longest Path Problem

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Linear Structure of Bipartite Permutation Graphs and the Longest Path Problem Linear Structure of Bipartite Permutation Graphs and the Longest Path Problem Ryuhei Uehara ∗ School of Information Science, JAIST, Ishikawa 923-1292, Japan Gabriel Valiente 1 Department of Software, Technical University of Catalonia, E-08034 Barcelona Abstract The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposi- tion of a bipartite permutation graph is proposed in this note. The decomposition gives a linear structure of bipartite permutation graphs, and it can be obtained in O(n) time, where n is the number of vertices. As an application of the decompo- sition, we show an O(n) time and space algorithm for finding a longest path in a bipartite permutation graph. Key words: Bipartite permutation graphs; Graph decomposition; Linear time algorithms. 1 Introduction A large number of graph classes have been recently proposed, and the com- plexity of hard problems over these graph classes has been thoroughly investi- gated [2,11], motivated by the fact that some hard problems become efficiently ∗ Corresponding author. Fax: +81-761-51-1149. Email addresses: [email protected] (Ryuhei Uehara), [email protected] (Gabriel Valiente). 1 Partially supported by Spanish CICYT project GRAMMARS (TIN2004-07925- C03-01) and by the Japan Society for the Promotion of Science through Long- term Invitation Fellowship L05511 for visiting JAIST (Japan Advanced Institute of Science and Technology). Preprint submitted to Information Processing Letters 29 December 2006 solvable when restricted to particular graph classes. This is a very common approach to solve realistic hard problems; for example, the class of interval graphs was first studied by a molecular biologist, and it turned out that many hard problems can be solved efficiently on these graphs [5, Chapter 8]. On the other hand, from the graph theoretic point of view, these algorithms reveal and make use of graph theoretical properties of the graph classes. In this note, we focus on the class of bipartite permutation graphs. A graph is a bipartite permutation graph if it is a bipartite graph and a permutation graph. This class was investigated by Spinrad, Brandst¨adt, and Stewart [12], and some applications were also investigated by Lai and Wei [8]. We first introduce a new notion of complete bipartite decomposition of a bi- partite permutation graph. Intuitively, a bipartite permutation graph can be decomposed into an alternating sequence of complete bipartite graphs and independent sets. In the decomposition, two complete bipartite graphs are joined only if they are consecutive. Hence this decomposition allows us to ap- ply dynamic programming techniques to problems on bipartite permutation graphs. The decomposition can be computed in O(n) time for any given bi- partite permutation graph, where n is the number of vertices. (We note that a bipartite permutation graph has a simple representation taking only O(n) space, and hence we assume that it is given in such a compact representation.) In [3], Brandst¨adtand Lozin gave a similar characterization of bipartite permu- tation graphs, which from a graph theoretic point of view is a sequence of chain graphs. Each chain graph can be obtained by merging two consecutive graphs (a complete bipartite graph and an independent set) in our decomposition. Hence our result also gives a linear time algorithm for their characterization. As an application of the decomposition, we give an O(n) time and space algo- rithm for finding a longest path in a bipartite permutation graph. The longest path problem is one of the most basic problems, and it seems to be harder than the Hamiltonian path problem. The main difficulty of the longest path problem compared to the Hamiltonian path problem is the difference between “all vertices” and “the maximum number of vertices.” For the Hamiltonian path problem, we try to join all vertices, and halt if it is impossible. On the other hand, for the longest path problem, we have to choose the best vertex in each case. The computation of the best choice is hard in general; even if we know that a given graph has a Hamiltonian path, it is impossible to find a path of length n − n for any > 0 in polynomial time unless P = NP [6]. It is well known that the Hamiltonian path problem is already hard; it is NP- complete for a chordal bipartite graph [10]. Hence there are few polynomial time algorithms for the longest path problem except on trees and some small graph classes [13]. For example, the complexity of the longest path problem for the class of biconvex graphs, which properly contains the class of bipar- 2 tite permutation graphs, is still open [13]. We show an O(n) time and space algorithm for finding a longest path in a bipartite permutation graph, which improves the previously known O(n + m) time and space algorithm [13]. 2 Preliminaries The neighborhood of a vertex v in a graph G = (V, E) is the set NG(v) = {u ∈ V | {u, v} ∈ E}, and the degree of a vertex v is |NG(v)| and it is denoted by degG(v). For a vertex subset U of V , we denote by NG(U) the set {v ∈ V | v ∈ N(u) for some u ∈ U}. If no confusion can arise we will omit the index G. A vertex set I is called independent set if G contains no edges between any pair of vertices in I. For a graph G = (V, E), a sequence of distinct vertices v1, v2, . , v` is a path, denoted by (v1, v2, . , v`), if {vj, vj+1} ∈ E for each 0 < j < `. The length of a path P is the number of vertices on the path, and it is denoted by |P |. In this note, we sometimes deal with a path P as a vertex set; hence we define the length of a path by the number of vertices, and |P | always denotes a number of vertices. The longest path problem is to find a path of maximum length. A graph G = (V, E) is bipartite if V can be partitioned into two sets X and Y such that every edge joins a vertex in X and another vertex in Y . A bipartite graph G = (X, Y, E) is said to be complete if each vertex in X is adjacent to all vertices in Y . A graph G = (V, E) with |V | = {v1, v2, . , vn} is said to be a permutation graph if there is a permutation σ over {1, 2, . , n} such that {vi, vj} ∈ E if and only if (i − j)(σ−1(i) − σ−1(j)) < 0. Intuitively, each vertex v in a permutation graph corresponds to a line `v joining two points on two parallel lines L1 and L2, which is called line representation. Then, two vertices v and u are adjacent if and only if the corresponding lines `v and `u are crossing. Vertex indices give the ordering of the points on L1, and the permutation of the indices gives the ordering of the points on L2. When a permutation graph is bipartite, it is said to be a bipartite permutation graph. Hereafter, we sometimes identify the vertex v and the corresponding line `v and denote it by v in the line representation. In this paper, a given bipartite graph is denoted by G = (X, Y, E), with nx = |X|, ny = |Y |, and n = nx + ny. Let G = (X, Y, E) be a bipartite permutation graph. Then, no line x in X in- 0 tersects any other line x in X. Hence, we order vertices x1, x2, . , xnx from left to right. We also order vertices y1, y2, . , yny from left to right. In this paper, we use the standard random-access machine (RAM) model of computation 3 Ly R z x L2 L1 x1 x2 xnx y1 y2 yny Fig. 1. A chain graph (see, e.g., [4]); each simple operation takes 1 time step, the time complexity is measured by the number of operations, and the space complexity is measured by the number of required memory cells. Especially, it stores and reads each datum in a memory cell in O(1) time and space, even if it requires O(log n) bits. Under the RAM model, a bipartite permutation graph G = (X, Y, E) can be represented in O(n) space by storing the vertex orderings on L1 and L2. We use two arrays L1 and L2, which correspond to the lines L1 and L2. For each i = 1, 2 and j = 1, 2, . , n, Li(j) stores (1) a flag that indicates if the endpoint belongs to X or to Y , (2) the index of the element in X or Y , and (3) the pointer to the other endpoint on L3−i. We sometimes say u < v on L1 if the endpoint of u on L1 is to the left of the endpoint of v. For a point p (not necessarily endpoint) on L1, we also make an abuse of notation and denote by u < p on L1 that the endpoint of u on L1 is to the left of point p. A bipartite graph G = (X, Y, E) is called chain graph if the vertices can be linearly ordered by inclusion; namely, N(x1) ⊆ N(x2) ⊆ · · · ⊆ N(xnx ) and N(yny ) ⊆ · · · ⊆ N(y2) ⊆ N(y1) [7,14]. It is known that any chain graph is a bipartite permutation graph, and its linear orderings over X and Y can be computed in O(n) time [13, Lemma 7] 2 . Lemma 1 Let G = (X, Y, E) be a connected chain graph with N(x1) ⊆ N(x2) ⊆ · · · ⊆ N(xnx ) and N(yny ) ⊆ · · · ⊆ N(y2) ⊆ N(y1).
Load more

Recommended publications
  • On Computing Longest Paths in Small Graph Classes
    On Computing Longest Paths in Small Graph Classes Ryuhei Uehara∗ Yushi Uno† July 28, 2005 Abstract The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigated, few graph classes are known to be solved efficiently for the longest path problem. For a tree, a simple linear time algorithm for the longest path problem is known. We first generalize the algorithm, and show that the longest path problem can be solved efficiently for weighted trees, block graphs, and cacti. We next show that the longest path problem can be solved efficiently on some graph classes that have natural interval representations. Keywords: efficient algorithms, graph classes, longest path problem. 1 Introduction The Hamiltonian path problem is one of the most well known NP-hard problem, and there are numerous applications of the problems [17]. For such an intractable problem, there are two major approaches; approximation algorithms [20, 2, 35] and algorithms with parameterized complexity analyses [15]. In both approaches, we have to change the decision problem to the optimization problem. Therefore the longest path problem is one of the basic problems from the viewpoint of combinatorial optimization. From the practical point of view, it is also very natural approach to try to find a longest path in a given graph, even if it does not have a Hamiltonian path. However, finding a longest path seems to be more difficult than determining whether the given graph has a Hamiltonian path or not.
    [Show full text]
  • Approximating the Maximum Clique Minor and Some Subgraph Homeomorphism Problems
    Approximating the maximum clique minor and some subgraph homeomorphism problems Noga Alon1, Andrzej Lingas2, and Martin Wahlen2 1 Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv. [email protected] 2 Department of Computer Science, Lund University, 22100 Lund. [email protected], [email protected], Fax +46 46 13 10 21 Abstract. We consider the “minor” and “homeomorphic” analogues of the maximum clique problem, i.e., the problems of determining the largest h such that the input graph (on n vertices) has a minor isomorphic to Kh or a subgraph homeomorphic to Kh, respectively, as well as the problem of finding the corresponding subgraphs. We term them as the maximum clique minor problem and the maximum homeomorphic clique problem, respectively. We observe that a known result of Kostochka and √ Thomason supplies an O( n) bound on the approximation factor for the maximum clique minor problem achievable in polynomial time. We also provide an independent proof of nearly the same approximation factor with explicit polynomial-time estimation, by exploiting the minor separator theorem of Plotkin et al. Next, we show that another known result of Bollob´asand Thomason √ and of Koml´osand Szemer´ediprovides an O( n) bound on the ap- proximation factor for the maximum homeomorphic clique achievable in γ polynomial time. On the other hand, we show an Ω(n1/2−O(1/(log n) )) O(1) lower bound (for some constant γ, unless N P ⊆ ZPTIME(2(log n) )) on the best approximation factor achievable efficiently for the maximum homeomorphic clique problem, nearly matching our upper bound.
    [Show full text]
  • Downloaded the Biochemical Pathways Information from the Saccharomyces Genome Database (SGD) [29], Which Contains for Each Enzyme of S
    Algorithms 2015, 8, 810-831; doi:10.3390/a8040810 OPEN ACCESS algorithms ISSN 1999-4893 www.mdpi.com/journal/algorithms Article Finding Supported Paths in Heterogeneous Networks y Guillaume Fertin 1;*, Christian Komusiewicz 2, Hafedh Mohamed-Babou 1 and Irena Rusu 1 1 LINA, UMR CNRS 6241, Université de Nantes, Nantes 44322, France; E-Mails: [email protected] (H.M.-B.); [email protected] (I.R.) 2 Institut für Softwaretechnik und Theoretische Informatik, Technische Universität Berlin, Berlin D-10587, Germany; E-Mail: [email protected] y This paper is an extended version of our paper published in the Proceedings of the 11th International Symposium on Experimental Algorithms (SEA 2012), Bordeaux, France, 7–9 June 2012, originally entitled “Algorithms for Subnetwork Mining in Heterogeneous Networks”. * Author to whom correspondence should be addressed; E-Mail: [email protected]; Tel.: +33-2-5112-5824. Academic Editor: Giuseppe Lancia Received: 17 June 2015 / Accepted: 29 September 2015 / Published: 9 October 2015 Abstract: Subnetwork mining is an essential issue in the analysis of biological, social and communication networks. Recent applications require the simultaneous mining of several networks on the same or a similar vertex set. That is, one searches for subnetworks fulfilling different properties in each input network. We study the case that the input consists of a directed graph D and an undirected graph G on the same vertex set, and the sought pattern is a path P in D whose vertex set induces a connected subgraph of G. In this context, three concrete problems arise, depending on whether the existence of P is questioned or whether the length of P is to be optimized: in that case, one can search for a longest path or (maybe less intuitively) a shortest one.
    [Show full text]
  • On Digraph Width Measures in Parameterized Algorithmics (Extended Abstract)
    On Digraph Width Measures in Parameterized Algorithmics (extended abstract) Robert Ganian1, Petr Hlinˇen´y1, Joachim Kneis2, Alexander Langer2, Jan Obdrˇz´alek1, and Peter Rossmanith2 1 Faculty of Informatics, Masaryk University, Brno, Czech Republic {xganian1,hlineny,obdrzalek}@fi.muni.cz 2 Theoretical Computer Science, RWTH Aachen University, Germany {kneis,langer,rossmani}@cs.rwth-aachen.de Abstract. In contrast to undirected width measures (such as tree- width or clique-width), which have provided many important algo- rithmic applications, analogous measures for digraphs such as DAG- width or Kelly-width do not seem so successful. Several recent papers, e.g. those of Kreutzer–Ordyniak, Dankelmann–Gutin–Kim, or Lampis– Kaouri–Mitsou, have given some evidence for this. We support this di- rection by showing that many quite different problems remain hard even on graph classes that are restricted very beyond simply having small DAG-width. To this end, we introduce new measures K-width and DAG- depth. On the positive side, we also note that taking Kant´e’s directed generalization of rank-width as a parameter makes many problems fixed parameter tractable. 1 Introduction The very successful concept of graph tree-width was introduced in the context of the Graph Minors project by Robertson and Seymour [RS86,RS91], and it turned out to be very useful for efficiently solving graph problems. Tree-width is a property of undirected graphs. In this paper we will be interested in directed graphs or digraphs. Naturally, a width measure specifically tailored to digraphs with all the nice properties of tree-width would be tremendously useful. The properties of such a measure should include at least the following: i) The width measure is small on many interesting instances.
    [Show full text]
  • Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree
    Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree Karthekeyan Chandrasekaran∗ Elena Grigorescuy Gabriel Istratez Shubhang Kulkarniy Young-San Liny Minshen Zhuy November 23, 2020 Abstract A heapable sequence is a sequence of numbers that can be arranged in a min-heap data structure. Finding a longest heapable subsequence of a given sequence was proposed by Byers, Heeringa, Mitzenmacher, and Zervas (ANALCO 2011) as a generalization of the well-studied longest increasing subsequence problem and its complexity still remains open. An equivalent formulation of the longest heapable subsequence problem is that of finding a maximum-sized binary tree in a given permutation directed acyclic graph (permutation DAG). In this work, we study parameterized algorithms for both longest heapable subsequence as well as maximum-sized binary tree. We show the following results: 1. The longest heapable subsequence problem can be solved in kO(log k)n time, where k is the number of distinct values in the input sequence. 2. We introduce the alphabet size as a new parameter in the study of computational prob- lems in permutation DAGs. Our result on longest heapable subsequence implies that the maximum-sized binary tree problem in a given permutation DAG is fixed-parameter tractable when parameterized by the alphabet size. 3. We show that the alphabet size with respect to a fixed topological ordering can be com- puted in polynomial time, admits a min-max relation, and has a polyhedral description. 4. We design a fixed-parameter algorithm with run-time wO(w)n for the maximum-sized bi- nary tree problem in undirected graphs when parameterized by treewidth w.
    [Show full text]
  • Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models
    Combinatorial Optimization and Recognition of Graph Classes with Applications to Related Models Von der Fakult¨at fur¨ Mathematik, Informatik und Naturwissenschaften der RWTH Aachen University zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften genehmigte Dissertation vorgelegt von Diplom-Mathematiker George B. Mertzios aus Thessaloniki, Griechenland Berichter: Privat Dozent Dr. Walter Unger (Betreuer) Professor Dr. Berthold V¨ocking (Zweitbetreuer) Professor Dr. Dieter Rautenbach Tag der mundlichen¨ Prufung:¨ Montag, den 30. November 2009 Diese Dissertation ist auf den Internetseiten der Hochschulbibliothek online verfugbar.¨ Abstract This thesis mainly deals with the structure of some classes of perfect graphs that have been widely investigated, due to both their interesting structure and their numerous applications. By exploiting the structure of these graph classes, we provide solutions to some open problems on them (in both the affirmative and negative), along with some new representation models that enable the design of new efficient algorithms. In particular, we first investigate the classes of interval and proper interval graphs, and especially, path problems on them. These classes of graphs have been extensively studied and they find many applications in several fields and disciplines such as genetics, molecular biology, scheduling, VLSI design, archaeology, and psychology, among others. Although the Hamiltonian path problem is well known to be linearly solvable on interval graphs, the complexity status of the longest path problem, which is the most natural optimization version of the Hamiltonian path problem, was an open question. We present the first polynomial algorithm for this problem with running time O(n4). Furthermore, we introduce a matrix representation for both interval and proper interval graphs, called the Normal Interval Representation (NIR) and the Stair Normal Interval Representation (SNIR) matrix, respectively.
    [Show full text]
  • Treewidth and Pathwidth of Permutation Graphs
    Treewidth and pathwidth of permutation graphs Citation for published version (APA): Bodlaender, H. L., Kloks, A. J. J., & Kratsch, D. (1992). Treewidth and pathwidth of permutation graphs. (Universiteit Utrecht. UU-CS, Department of Computer Science; Vol. 9230). Utrecht University. Document status and date: Published: 01/01/1992 Document Version: Publisher’s PDF, also known as Version of Record (includes final page, issue and volume numbers) Please check the document version of this publication: • A submitted manuscript is the version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers. Link to publication General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal for the purpose of private study or research. • You may not further distribute the material or use it for any profit-making activity or commercial gain • You may freely distribute the URL identifying the publication in the public portal.
    [Show full text]
  • Optimal Longest Paths by Dynamic Programming∗
    Optimal Longest Paths by Dynamic Programming∗ Tomáš Balyo1, Kai Fieger1, and Christian Schulz1,2 1 Karlsruhe Institute of Technology, Karlsruhe, Germany {tomas.balyo, christian.schulz}@kit.edu, fi[email protected] 2 University of Vienna, Vienna, Austria [email protected] Abstract We propose an optimal algorithm for solving the longest path problem in undirected weighted graphs. By using graph partitioning and dynamic programming, we obtain an algorithm that is significantly faster than other state-of-the-art methods. This enables us to solve instances that have previously been unsolved. 1998 ACM Subject Classification G.2.2 Graph Theory Keywords and phrases Longest Path, Graph Partitioning Digital Object Identifier 10.4230/LIPIcs.SEA.2017. 1 Introduction The longest path problem (LP) is to find a simple path of maximum length between two given vertices of a graph where length is defined as the number of edges or the total weight of the edges in the path. The problem is known to be NP-complete [5] and has several applications such as designing circuit boards [8, 7], project planning [2], information retrieval [15] or patrolling algorithms for multiple robots in graphs [9]. For example, when designing circuit boards where the length difference between wires has to be kept small [8, 7], the longest path problem manifests itself when the length of shorter wires is supposed to be increased. Another example application is project planning/scheduling where the problem can be used to determine the least amount of time that a project could be completed in [2]. We organize the rest of paper as follows.
    [Show full text]
  • Classes of Perfect Graphs
    This paper appeared in: Discrete Mathematics 306 (2006), 2529-2571 Classes of Perfect Graphs Stefan Hougardy Humboldt-Universit¨atzu Berlin Institut f¨urInformatik 10099 Berlin, Germany [email protected] February 28, 2003 revised October 2003, February 2005, and July 2007 Abstract. The Strong Perfect Graph Conjecture, suggested by Claude Berge in 1960, had a major impact on the development of graph theory over the last forty years. It has led to the definitions and study of many new classes of graphs for which the Strong Perfect Graph Conjecture has been verified. Powerful concepts and methods have been developed to prove the Strong Perfect Graph Conjecture for these special cases. In this paper we survey 120 of these classes, list their fundamental algorithmic properties and present all known relations between them. 1 Introduction A graph is called perfect if the chromatic number and the clique number have the same value for each of its induced subgraphs. The notion of perfect graphs was introduced by Berge [6] in 1960. He also conjectured that a graph is perfect if and only if it contains, as an induced subgraph, neither an odd cycle of length at least five nor its complement. This conjecture became known as the Strong Perfect Graph Conjecture and attempts to prove it contributed much to the developement of graph theory in the past forty years. The methods developed and the results proved have their uses also outside the area of perfect graphs. The theory of antiblocking polyhedra developed by Fulkerson [37], and the theory of modular decomposition (which has its origins in a paper of Gallai [39]) are two such examples.
    [Show full text]
  • Subexponential Parameterized Algorithms
    Subexponential parameterized algorithms Frederic Dorn∗, Fedor V. Fomin?, and Dimitrios M. Thilikos?? Abstract. We present a series of techniques for the design of subexpo- nential parameterized algorithms for graph problems. The design of such algorithms usually consists of two main steps: first find a branch- (or tree-) decomposition of the input graph whose width is bounded by a sublinear function of the parameter and, second, use this decomposition to solve the problem in time that is single exponential to this bound. The main tool for the first step is Bidimensionality Theory. Here we present the potential, but also the boundaries, of this theory. For the second step, we describe recent techniques, associating the analysis of sub-exponential algorithms to combinatorial√ bounds related to Catalan numbers. As a result, we have 2O( k) · nO(1) time algorithms for a wide variety of parameterized problems on graphs, where n is the size of the graph and k is the parameter. 1 Introduction The theory of fixed-parameter algorithms and parameterized complexity has been thoroughly developed during the last two decades; see e.g. the books [23, 27, 35]. Usually, parameterizing a problem on graphs is to consider its input as a pair consisting of the graph G itself and a parameter k. Typical examples of such parameters are the size of a vertex cover, the length of a path or the size of a dominating set. Roughly speaking, a parameterized problem in graphs with parameter k is fixed parameter tractable if there is an algorithm solving the problem in f(k) · nO(1) steps for some function f that depends only on the parameter.
    [Show full text]
  • Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs
    Parameterized Complexity of Induced Graph Matching on Claw-Free Graphs∗ Danny Hermelin† Matthias Mnich‡ Erik Jan van Leeuwen§ Abstract The Induced Graph Matching problem asks to find k disjoint induced subgraphs isomorphic to a given graph H in a given graph G such that there are no edges between vertices of different subgraphs. This problem generalizes the classical Independent Set and Induced Matching problems, among several other problems. We show that In- duced Graph Matching is fixed-parameter tractable in k on claw-free graphs when H is a fixed connected graph, and even admits a polynomial kernel when H is a complete graph. Both results rely on a new, strong, and generic algorithmic structure theorem for claw-free graphs. Complementing the above positive results, we prove W[1]-hardness of Induced Graph Matching on graphs excluding K1,4 as an induced subgraph, for any fixed complete graph H. In particular, we show that Independent Set is W[1]-hard on K1,4-free graphs. Finally, we consider the complexity of Induced Graph Matching on a large subclass of claw-free graphs, namely on proper circular-arc graphs. We show that the problem is either polynomial-time solvable or NP-complete, depending on the connectivity of H and the structure of G. 1 Introduction A graph is claw-free if no vertex in the graph has three pairwise nonadjacent neighbors, i.e. if it does not contain a copy of K1,3 as an induced subgraph. The class of claw-free graphs contains several well-studied graph classes such as line graphs, unit interval graphs, de Bruijn graphs, the complements of triangle-free graphs, and graphs of several polyhedra and polytopes.
    [Show full text]
  • Permutations and Permutation Graphs
    Permutations and permutation graphs Robert Brignall Schloss Dagstuhl, 8 November 2018 1 / 25 Permutations and permutation graphs 4 1 2 6 3 8 5 7 • Permutation p = p(1) ··· p(n) • Inversion graph Gp: for i < j, ij 2 E(Gp) iff p(i) > p(j). • Note: n ··· 21 becomes Kn. • Permutation graph = can be made from a permutation 2 / 25 Permutations and permutation graphs 4 1 2 6 3 8 5 7 • Permutation p = p(1) ··· p(n) • Inversion graph Gp: for i < j, ij 2 E(Gp) iff p(i) > p(j). • Note: n ··· 21 becomes Kn. • Permutation graph = can be made from a permutation 2 / 25 Ordering permutations: containment 1 3 5 2 4 < 4 1 2 6 3 8 5 7 • ‘Classical’ pattern containment: s ≤ p. • Translates to induced subgraphs: Gs ≤ind Gp. • Permutation class: a downset: p 2 C and s ≤ p implies s 2 C. • Avoidance: minimal forbidden permutation characterisation: C = Av(B) = fp : b 6≤ p for all b 2 Bg. 3 / 25 Ordering permutations: containment 1 3 5 2 4 < 4 1 2 6 3 8 5 7 • ‘Classical’ pattern containment: s ≤ p. • Translates to induced subgraphs: Gs ≤ind Gp. • Permutation class: a downset: p 2 C and s ≤ p implies s 2 C. • Avoidance: minimal forbidden permutation characterisation: C = Av(B) = fp : b 6≤ p for all b 2 Bg. 3 / 25 Ordering permutations: containment 1 3 5 2 4 < 4 1 2 6 3 8 5 7 • ‘Classical’ pattern containment: s ≤ p. • Translates to induced subgraphs: Gs ≤ind Gp. • Permutation class: a downset: p 2 C and s ≤ p implies s 2 C.
    [Show full text]