Applications of Lexicographic Breadth-First Search to Modular Decomposition, Split Decomposition, and Circle Graphs by Marc Tedd

Total Page:16

File Type:pdf, Size:1020Kb

Applications of Lexicographic Breadth-First Search to Modular Decomposition, Split Decomposition, and Circle Graphs by Marc Tedd Applications of Lexicographic Breadth-First Search to Modular Decomposition, Split Decomposition, and Circle Graphs by Marc Tedder A thesis submitted in conformity with the requirements for the degree of Doctor of Philosophy Graduate Department of Computer Science University of Toronto Copyright c 2011 by Marc Tedder Abstract Applications of Lexicographic Breadth-First Search to Modular Decomposition, Split Decomposition, and Circle Graphs Marc Tedder Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2011 This thesis presents the first sub-quadratic circle graph recognition algorithm, and develops im- proved algorithms for two important hierarchical decomposition schemes: modular decomposition and split decomposition. The modular decomposition algorithm results from unifying two dif- ferent approaches previously employed to solve the problem: divide-and-conquer and factorizing permutations. It runs in linear-time, and is straightforward in its understanding, correctness, and implementation. It merely requires a collection of trees and simple traversals of these trees. The split-decomposition algorithm is similar in being straightforward in its understanding and correctness. An efficient implementation of the algorithm is described that uses the union-find data-structure. A novel charging argument is used to prove the running-time. The algorithm is the first to use the recent reformulation of split decomposition in terms of graph-labelled trees. This facilitates its extension to circle graph recognition. In particular, it allows us to efficiently apply a new lexicographic breadth-first search characterization of circle graphs developed in the thesis. Lexicographic breadth-first search is additionally responsible for the efficiency of the split decom- position algorithm, and contributes to the simplicity of the modular decomposition algorithm. ii Acknowledgements It is no secret to those who know me that I have had difficulty reconciling myself to my subject. What has made it easier – and made this thesis possible – is the tremendous kindness, generosity, and patience of a number of people. My supervisor, Derek Corneil, is foremost amongst these. He has somehow managed to endure my persistent irreverence toward the subject to which he has dedicated his life. However, it is not so much his dedication that has tolerated me as it has been his understanding. This has afforded me the luxury of arriving at this point on my own terms, and along the way, presented me the opportunities for my success. Although his role in this signals his recognition of its importance, he cannot possibly appreciate my gratitude. I could not have been more fortunate to have had him as my supervisor. It is not often that one gets the chance to say that their coauthors changed their life. But that is what Michel Habib and Christophe Paul did when they invited me to study with them in France for nearly two months in 2008. As clich´ed though it may be, one cannot spend a month in Paris without being changed. Of course, spending two weeks in Provence has no less effect. But what I will remember as much as the museums and the aqueducts is the enthusiasm of both Michel and Christophe. It has the quality of making you want to learn. My greatest wish would be to learn some of their skills in seeing connections between problems. And from my other coauthor, Emeric Gioan, whose introduction in Montpellier I owe to Christophe, my wish would be to learn some of his skills in seeing problems so sharply. My hope is that this thesis reflects some progress in these pursuits. Countless people from the Department of Computer Science at the University of Toronto deserve recognition for their contributions to this thesis, both direct and indirect. My PhD Supervisory Committee recommended content changes that have improved its quality, and have been forgiving enough to permit my unorthodox road to completion. That road was partially paved by the assistance of Linda Chow in the graduate office, who never failed to come through for me. All the while, my friends in the department have helped make these the best years of my life. Too often we don’t realize this until after such years have passed. They made me realize this each day I came to the office. It seems undignified to mention each by name, but I will single out Ingrid. For it is she who introduced me to Yuki. And it is Yuki who has given all of this meaning. iii Contents 1 Introduction 1 1.1 OverviewoftheThesis............................. ...... 3 2 Background 4 2.1 ModularDecomposition . ...... 4 2.2 SplitDecomposition .............................. ...... 7 2.3 CircleGraphs.................................... 10 2.4 Lexicographic Breadth-First Search . ............ 12 3 Technical Background 15 3.1 Preliminaries ................................... ..... 15 3.2 ModularDecomposition . ...... 17 3.3 SplitDecomposition .............................. ...... 19 3.3.1 Graph-LabelledTrees . 21 3.4 CircleGraphs.................................... 28 3.5 Lexicographic Breadth-First Search . ............ 30 4 Simple, Linear-Time Modular Decomposition 33 4.1 DividingbyLBFS .................................. 33 4.2 Modules Not Containing the Pivot . ........ 36 4.3 Factorizing Permutation . ........ 43 4.4 ModulesContainingthePivot. ........ 49 4.5 Conquering ...................................... 54 4.6 ImplementationandRunningTime. ........ 57 4.6.1 DividingbyLBFS ................................ 59 4.6.2 Modules Not Containing the Pivot . ...... 59 iv 4.6.3 Factorizing Permutation . ...... 60 4.6.4 Modules Containing the Pivot . ...... 60 4.6.5 Conquering .................................... 61 5 Simpler and Efficient Split Decomposition 63 5.1 Incremental Split-Decomposition . ........... 64 5.1.1 StateAssignment............................... 64 5.1.2 Pruning:AReduction . .. .. .. .. .. .. .. .. 65 5.1.3 ExistenceofanUnmixedNode . 68 5.1.4 Nonexistence of an Unmixed Node . ..... 71 5.1.5 CombiningtheCases.. .. .. .. .. .. .. .. .. 77 5.1.6 Incremental Characterization . ........ 80 5.2 LBFS-Incremental Split Decomposition . ........... 82 5.2.1 RegulatingTwins............................... 83 5.2.2 RegulatingStars ............................... 86 5.3 AnImplementation................................ ..... 89 5.3.1 TheData-Structure ............................. 89 5.3.2 Simplifications and Notation . ...... 92 5.3.3 Updatinglastanduniversal . ...... 93 5.3.4 Pruning ....................................... 94 5.3.5 ExistenceofanUnmixedNode . 96 5.3.6 Cleaning...................................... 98 5.3.7 Contraction................................... 100 5.3.8 CombiningtheCases.. .. .. .. .. .. .. .. .. 103 5.4 AnAggregateAnalysis. .. .. .. .. .. .. .. .. 103 5.4.1 Setting Up the Charging Argument . 105 5.4.2 (Re)AssigningCharge . 107 5.4.3 BoundingtheTotalCharge . 111 5.4.4 BoundingtheRunning-Time . 114 6 (Almost) Linear-Time Circle Graph Recognition 116 6.1 AddingaGoodVertex............................... 117 6.2 ConsecutivityandGLTs . 119 6.2.1 ConsecutivityintheLabels . 120 6.2.2 ConsecutivityintheGraph . 123 v 6.3 Incremental Circle Graph Recognition . ...........127 6.3.1 Algorithm..................................... 130 6.3.2 ImplementationandRunningTime. 132 7 Conclusion 138 7.1 ModularDecomposition . 138 7.1.1 Practical Applications . 139 7.1.2 Transitive Orientation . 139 7.1.3 ComparativeAnalysis . 140 7.2 SplitDecomposition .............................. 141 7.2.1 Linear-TimeandUnion-Find . 141 7.2.2 Linear-time Without Union-Find . .......142 7.2.3 Simpler Split-Decomposition? . ........143 7.3 CircleGraphs.................................... 144 7.3.1 Linear-Time? .................................. 144 7.3.2 Linear-Time Recognition of Permutation Graphs . ...........145 7.3.3 Graph-Labelled Trees and their Generalizations . .............146 7.4 Lexicographic-Breadth First Search . ............146 7.4.1 ANewLBFSParadigm .............................. 147 7.4.2 Recognition of Chordal Bipartite Graphs . .........147 Bibliography 148 vi List of Figures 2.1 The set H = {a, b, c, d} isamodule. ........................... 5 2.2 Composing two graphs by adding all possible edges between A′ = {a, b, c, d} and B′ = {e, f}. If A = {a, b, c, d, k, ℓ} and B = {e, f, g, h, i, j}, then (A, B) is a split in theresultinggraph.................................. .... 7 2.3 A chord diagram on the left, and its corresponding circle graph on the right. 10 2.4 The chords corresponding to N(x) appear consecutively without repetition. 12 3.1 The modular decomposition tree for the graph in figure 2.1. We use “P” to stand for prime, and 0 and 1 to stand for “parallel” and “series”, respectively. The use of 0and1iscommonintheliterature. ..... 18 3.2 The split decomposition tree of the graph in figure 2.2. ............... 21 3.3 An example of a graph-labelled tree. .......... 22 3.4 The GLT induced by the nodes not incident to e and f in the GLT of figure 3.3. 23 3.5 Grafting two GLTs with respect to q and q′........................ 24 3.6 An example of the node-join and node-split operations. ............... 26 3.7 An example of the clique-join and clique-split operations. ............... 26 3.8 An example of the star-join and star-split operations. ................. 27 3.9 Chord diagrams for two degenerate graphs: on the left, a clique on four vertices; on the right, a star with three extremities. Chord diagrams can be obtained for any degenerate graph by following the patterns above. ........... 30 4.1 An example graph to demonstrate
Recommended publications
  • 5Th Lecture : Modular Decomposition MPRI 2013–2014 Schedule A
    5th Lecture : Modular decomposition MPRI 2013–2014 5th Lecture : Modular decomposition MPRI 2013–2014 Schedule 5th Lecture : Modular decomposition Introduction MPRI 2013–2014 Graph searches Michel Habib Applications of LBFS on structured graph classes [email protected] http://www.liafa.univ-Paris-Diderot.fr/~habib Chordal graphs Cograph recognition Sophie Germain, 22 octobre 2013 A nice conjecture 5th Lecture : Modular decomposition MPRI 2013–2014 5th Lecture : Modular decomposition MPRI 2013–2014 Introduction A hierarchy of graph models 1. Undirected graphs (graphes non orient´es) 2. Tournaments (Tournois), sometimes 2-circuits are allowed. 3. Signed graphs (Graphes sign´es) each edge is labelled + or - (for example friend or enemy) Examen le mardi 26 novembre de 9h `a12h 4. Oriented graphs (Graphes orient´es), each edge is given a Salle habituelle unique direction (no 2-circuits) An interesting subclass are the DAG Directed Acyclic Graphs (graphes sans circuit), for which the transitive closure is a partial order (ordre partiel) 5. Partial orders and comparability graphs an intersting particular case. Duality comparability – cocomparability (graphes de comparabilit´e– graphes d’incomparabilit´e) 6. Directed graphs or digraphs (Graphes dirig´es) 5th Lecture : Modular decomposition MPRI 2013–2014 5th Lecture : Modular decomposition MPRI 2013–2014 Introduction Introduction The problem has to be defined in each model and sometimes it could be hard. ◮ What is the right notion for a coloration in a directed graph ? For partial orders, comparability graphs or uncomparability graphs ◮ No directed cycle unicolored, seems to be the good one. the independant set and maximum clique problems are polynomial. ◮ It took 20 years to find the right notion of oriented matro¨ıd ◮ What is the right notion of treewidth for directed graphs ? ◮ Still an open question.
    [Show full text]
  • Split Decomposition and Graph-Labelled Trees
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector Discrete Applied Mathematics 160 (2012) 708–733 Contents lists available at SciVerse ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Split decomposition and graph-labelled trees: Characterizations and fully dynamic algorithms for totally decomposable graphsI Emeric Gioan, Christophe Paul ∗ CNRS - LIRMM, Université de Montpellier 2, France article info a b s t r a c t Article history: In this paper, we revisit the split decomposition of graphs and give new combinatorial and Received 20 May 2010 algorithmic results for the class of totally decomposable graphs, also known as the distance Received in revised form 3 February 2011 hereditary graphs, and for two non-trivial subclasses, namely the cographs and the 3-leaf Accepted 23 May 2011 power graphs. Precisely, we give structural and incremental characterizations, leading to Available online 23 July 2011 optimal fully dynamic recognition algorithms for vertex and edge modifications, for each of these classes. These results rely on the new combinatorial framework of graph-labelled Keywords: trees used to represent the split decomposition of general graphs (and also the modular Split decomposition Distance hereditary graphs decomposition). The point of the paper is to use bijections between the aforementioned Fully dynamic algorithms graph classes and graph-labelled trees whose nodes are labelled by cliques and stars. We mention that this bijective viewpoint yields directly an intersection model for the class of distance hereditary graphs. ' 2012 Published by Elsevier B.V. 1. Introduction The 1-join composition and its complementary operation, the split decomposition, range among the classical operations in graph theory.
    [Show full text]
  • The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes
    The Use of a Pruned Modular Decomposition for Maximum Matching Algorithms on Some Graph Classes Guillaume Ducoffe ICI – National Institute for Research and Development in Informatics, Bucharest, Romania The Research Institute of the University of Bucharest ICUB, Bucharest, Romania guillaume.ducoff[email protected] Alexandru Popa University of Bucharest, Bucharest, Romania ICI – National Institute for Research and Development in Informatics, Bucharest, Romania [email protected] Abstract We address the following general question: given a graph class C on which we can solve Maximum Matching in (quasi) linear time, does the same hold true for the class of graphs that can be modularly decomposed into C? As a way to answer this question for distance-hereditary graphs and some other superclasses of cographs, we study the combined effect of modular decomposition with a pruning process over the quotient subgraphs. We remove sequentially from all such subgraphs their so-called one-vertex extensions (i.e., pendant, anti-pendant, twin, universal and isolated vertices). Doing so, we obtain a “pruned modular decomposition”, that can be computed in quasi linear time. Our main result is that if all the pruned quotient subgraphs have bounded order then a maximum matching can be computed in linear time. The latter result strictly extends a recent framework in (Coudert et al., SODA’18). Our work is the first to explain why the existence of some nice ordering over the modules of a graph, instead of just over its vertices, can help to speed up the computation of maximum matchings on some graph classes. 2012 ACM Subject Classification Mathematics of computing → Graph theory, Theory of com- putation → Design and analysis of algorithms Keywords and phrases maximum matching, FPT in P, modular decomposition, pruned graphs, one-vertex extensions, P4-structure Digital Object Identifier 10.4230/LIPIcs.ISAAC.2018.6 Related Version A full version of the paper is available at [14], https://arxiv.org/abs/1804.
    [Show full text]
  • The Wonderful World of Chordal Graphs
    The Wonderful World of Chordal Graphs Martin Charles Golumbic University of Haifa, Israel The 32nd European Conference on Combinatorial Optimization, ECCO XXXII, Malta, 2019 Preamble In 1970, Claude Berge published the original French version his fundamental and perhaps most important book, Graphes et Hypergraphes. To many graph theorists, its chapters were saplings ready to be cultivated into the vast forest that we know today. As we enter this 50th (Jubilee) anniversary year, we celebrate Le Bois de Berge with its mathematical palms, pines and poplars, firs, fruit and ficuses, oaks, maples and cacti. One of those sapling chapters was on Perfect Graphs. Berge challenged us with his Perfect Graph Conjecture, and surveyed its core subclasses: comparability graphs, interval graphs, and triangulated (chordal) graphs. —citing Fulkerson, Gallai, Ghouila-Houri, Gilmore, Hoffman, Hojós, Lovász. By the time the English version appeared in 1973, more sprouts could have been added to the blossoming family —Benzer, Dirac, Fishburn, Gavril, Roberts, Rose, Trotter. However, these and others would wait until 1980, when my own book Algorithmic Graph Theory and Perfect Graphs first appeared. —a direct outgrowth of Berge’s inspiring chapter. Triangulated graphs – also known as rigid circuit graphs (Dirac), acyclic graphs (Lekkerkerker and Boland) But it was Fanica Gavril who coined the term chordal graphs. A graph G is a chordal graph, if every cycle in G of length greater than or equal to 4 has a chord, that is, an edge connecting two vertices that are not consecutive on the cycle. NOT a chordal graph This IS a It has many copies of C4 chordal graph Fanica Gavril: “I knew that these graphs occurred before as triangulated graphs, but the term triangulated was also used for maximal planar graphs, implying the statement, ‘some planar triangulated graphs are not triangulated graphs’ (like the complete wheels).
    [Show full text]
  • Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
    Algorithmica DOI 10.1007/s00453-008-9273-0 Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs Christophe Crespelle · Christophe Paul Received: 5 June 2006 / Accepted: 22 December 2008 © Springer Science+Business Media, LLC 2009 Abstract This paper considers the problem of maintaining a compact representa- tion (O(n) space) of permutation graphs under vertex and edge modifications (inser- tion or deletion). That representation allows us to answer adjacency queries in O(1) time. The approach is based on a fully dynamic modular decomposition algorithm for permutation graphs that works in O(n) time per edge and vertex modification. We thereby obtain a fully dynamic algorithm for the recognition of permutation graphs. Keywords Dynamic algorithms · Permutation graphs · Modular decomposition 1 Introduction Finding efficient graph representations is a central question of algorithmic graph the- ory. How to store a graph to make its manipulation easier? Compact graph represen- tations often rest on the combinatorial structures of the considered graphs (see for example [22]). Thereby interesting graph encodings can be found when restricted to special graph classes. This paper deals with dynamic graphs and considers the dy- namic recognition and representation problem (see e.g. [21]), which, for a family F of graphs, aims to maintain a characteristic representation of dynamically changing graphs as long as the modified graph belongs to F. The input of the problem is a graph G ∈ F with its representation and a series of modifications. Any modification This paper is a full version of the extended abstract appeared in [5]. C. Crespelle () Université de Montpellier 2, LIRMM, Montpellier, France e-mail: [email protected] C.
    [Show full text]
  • Modular Decomposition and Transitive Orientation Ross M
    Discrete Mathematics 201 (1999) 189–241 Modular decomposition and transitive orientation Ross M. McConnell a;1, Jeremy P. Spinrad b;∗ a Department of Computer Science and Engineering, University of Colorado at Denver, P.O. Box 173364, Denver, CO 80217-3364, USA b Department of Computer Science, Vanderbilt University, Nashville, TN 37235, USA Abstract A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canonical linear-space representation for the modules of a graph, called the modular decomposition. Closely related to modular decomposition is the transitive orientation problem, which is the problem of assigning a direction to each edge of a graph so that the resulting digraph is transitive. A graph is a comparability graph if such an assignment is possible. We give O(n + m) algorithms for modular decomposition and transitive orientation, where n and m are the number of vertices and edges of the graph. This gives linear time bounds for recognizing permutation graphs, maximum clique and minimum vertex coloring on comparability graphs, and other combinatorial problems on comparability graphs and their complements. c 1999 Published by Elsevier Science B.V. All rights reserved 1. Introduction A partial order may be viewed as a transitive directed acyclic graph. A comparabil- ity graph is the graph obtained by ignoring the edge directions of a transitive directed acyclic graph. It is well known that every partial order is the intersection of a set of total (linear) orders [10].
    [Show full text]
  • Perfect Graphs Chinh T
    University of Dayton eCommons Computer Science Faculty Publications Department of Computer Science 2015 Perfect Graphs Chinh T. Hoang Wilfrid Laurier University R. Sritharan University of Dayton Follow this and additional works at: http://ecommons.udayton.edu/cps_fac_pub Part of the Graphics and Human Computer Interfaces Commons, and the Other Computer Sciences Commons eCommons Citation Hoang, Chinh T. and Sritharan, R., "Perfect Graphs" (2015). Computer Science Faculty Publications. 87. http://ecommons.udayton.edu/cps_fac_pub/87 This Book Chapter is brought to you for free and open access by the Department of Computer Science at eCommons. It has been accepted for inclusion in Computer Science Faculty Publications by an authorized administrator of eCommons. For more information, please contact [email protected], [email protected]. CHAPTE R 28 Perfect Graphs Chinh T. Hoang* R. Sritharan t CO NTENTS 28.1 Introd uction ... .. ..... ............. ............................... .. ........ .. 708 28.2 Notation ............................. .. ..................... .................... 710 28.3 Chordal Graphs ....................... ................. ....... ............. 710 28.3.1 Characterization ............ ........................... .... .. ... 710 28.3.2 Recognition .................... ..................... ... .. ........ .. ... 712 28.3.3 Optimization ................................................ .. ......... 715 28.4 Comparability Graphs ............................................... ..... .. 715 28.4.1 Characterization
    [Show full text]
  • A Survey on Algorithmic Aspects of Modular Decomposition∗
    A Survey on Algorithmic Aspects of Modular Decomposition∗ Michel Habiby Christophe Paulz December 10, 2009 Abstract The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important preprocessing step to solve a large number of combinatorial optimization problems. Since the first polynomial time algorithm in the early 70's, the algorithmic of the modular decomposition has known an important development. This paper survey the ideas and techniques that arose from this line of research. 1 Introduction Modular decomposition is a technique at the crossroads of several domains of combinatorics which applies to many discrete structures such as graphs, 2-structures, hypergraphs, set systems and ma- troids among others. As a graph decomposition technique it has been introduced by Gallai [Gal67] to study the structure of comparability graphs (those graphs whose edge set can be transitively oriented). Roughly speaking a module in graph is a subset M of vertices which share the same neighbourhood outside M. Galai showed that the family of modules of an undirected graph can be represented by a tree, the modular decomposition tree. The notion of module appeared in the lit- terature as closed sets [Gal67], clan [EGMS94], automonous sets [M¨oh85b], clumps [Bla78]. while the modular decomposition is also called substitution decomposition [M¨oh85a]or X-join decompo- sition [HM79]. See [MR84] for an early survey on this topic. There is a large variety of combinatorial applications of modular decomposition. Modules can help proving structural results on graphs as Galai did for comparability graphs.
    [Show full text]
  • Simple, Linear-Time Modular Decomposition
    Simple, Linear-time Modular Decomposition (Extended Abstract)∗ Marc Tedder,1 Derek Corneil,1 Michel Habib,2 Christophe Paul3 Abstract Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, linear-time algorithm for the problem. Despite considerable effort, such an algorithm has re- mained elusive. The linear-time algorithms to date are impractical and of mainly theoretical interest. In this paper we present the first simple, linear-time algorithm to compute the modular decomposition tree of an undirected graph. 1 Introduction A natural operation to perform on a graph G is to take one of its vertices, say v, and replace it with another graph G′, making v’s neighbours universal to the vertices of G′. Modular decomposition is interested in the inverse operation: finding a set of vertices sharing the same neighbours outside the set – that is, finding a module – and contracting this module into a single vertex. A graph’s modules form a partitive family [2], and as such, define a decomposition scheme for the graph with an associated decomposition tree composed of the graph’s strong modules – those that don’t overlap other modules. To compute this modular decomposition tree is to compute the modular decomposition (and vice versa); and with its succinct representation of a graph’s structure, its computation is often a first-step in many algorithms. Indeed, since Gallai first noticed its importance to comparability graphs [11], modular decomposition has been established as a fundamental tool in algorithmic graph arXiv:0710.3901v2 [cs.DM] 20 Mar 2008 theory.
    [Show full text]
  • Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs
    Fully dynamic algorithm for recognition and modular decomposition of permutation graphs Christophe Crespelle Christophe Paul CNRS - D´epartement Informatique, LIRMM, Montpellier {crespell,paul}@lirmm.fr December 19, 2005 Abstract This paper considers the problem of maintaining a compact representation (O(n) space) of permutation graphs under vertex and edge modifications (insertion or deletion). That representation allows us to answer adjacency queries in O(1) time. The approach is based on a fully dynamic modular decomposition algorithm for permutation graphs that works in O(n) time per edge and vertex modification. We thereby obtain a fully dynamic algorithm for the recognition of permutation graphs. 1 Introduction The dynamic recognition and representation problem (see e.g. [16]) for a family F of graphs aims to maintain a characteristic representation of dynamically changing graphs as long as the modified graph belongs to F. The input of the problem is a graph G ∈ F with its representation and a series of modifications. Any modification is of the following: inserting or deleting a vertex (along with the edges incident to it), inserting or deleting an edge. Several authors have considered the dynamic recognition and representation problem for various graph families. [12] devised a fully dynamic recognition algorithm for chordal graphs which handles edge operations in O(n) time. For proper interval graphs [11], each update can be supported in O(d+log n) time where d is the number of edges involved in the operation. Cographs, a subfamily of permutation graphs, have been considered in [16] where any modification (edge or vertex) is supported in O(d) time, where d is the number of edges involved in the modification.
    [Show full text]
  • Partition Refinement
    Partition Refinement: a meaningful technique for Graphs ∗ Qinna Wang [email protected] ABSTRACT final partition is the ordering elements. Note the complex- The partition refinement is a meaningful technique for ity of Quick Sort which is really considerable. Therefore, a applications in graphs. Currently, the applications in aim similar conceptual technique is then generated for develop- of the graph problems like chordal graphs [7], permutation ing algorithms, which is the partition refinement. graphs [6] and modular decomposition [3] focus on increasing the efficiency. In those propositions, the partition refinement In the domain of the graph, the partition refinement is de- plays an important role for the resolutions. Therefore, we veloped to split a class of partition vertices into disjoint sub- describe this efficient technique which overcomes the con- classes according to the adjacencies between vertices. In this straints such as the unreasonable complexity and ambigu- way, the underlying information of graphs is able to mined ous understanding of certain applications that are used for and particular graph problems can be resolved. For example, graph problems in this paper. Through the illustration with there are several proposed partition refinement applications various examples, we will show how efficient the algorithm for twin vertex calculation [6], chordal graphs recognition [7] become according to the partition refinement. and permutation graphs recognition [6]. For the valuable contributions of the partition refinement, Keywords we introduce it in this paper which is organized as: in section graph theory, partition refinement 2, we present the partition refinement in detail; in section 3, we describe several classical partition refinement appli- 1.
    [Show full text]
  • Capturing Polynomial Time Using Modular Decomposition
    Logical Methods in Computer Science Volume 15, Issue 1, 2019, pp. 24:1–24:38 Submitted Mar. 30, 2018 https://lmcs.episciences.org/ Published Mar. 05, 2019 CAPTURING POLYNOMIAL TIME USING MODULAR DECOMPOSITION BERIT GRUSSIEN Humboldt-Universit¨atzu Berlin, Unter den Linden 6, 10099 Berlin, Germany e-mail address: [email protected] Abstract. The question of whether there is a logic that captures polynomial time is one of the main open problems in descriptive complexity theory and database theory. In 2010 Grohe showed that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. We now consider classes of graphs with excluded induced subgraphs. For such graph classes, an effective graph decomposition, called modular decomposition, was introduced by Gallai in 1976. The graphs that are non-decomposable with respect to modular decomposition are called prime. We present a tool, the Modular Decomposition Theorem, that reduces (definable) canonization of a graph class C to (definable) canonization of the class of prime graphs of C that are colored with binary relations on a linearly ordered set. By an application of the Modular Decomposition Theorem, we show that fixed-point logic with counting captures polynomial time on the class of permutation graphs. Within the proof of the Modular Decomposition Theorem, we show that the modular decomposition of a graph is definable in symmetric transitive closure logic with counting. We obtain that the modular decomposition tree is computable in logarithmic space. It follows that cograph recognition and cograph canonization is computable in logarithmic space. 1. Introduction The aim of descriptive complexity theory is to find logics that characterize, or capture, complexity classes.
    [Show full text]