Split-Decomposition Trees with Prime Nodes: Enumeration and Random Generation of Cactus Graphs

In this paper, we build on recent results by Chauve et al. (2014) and Bahrani and Lumbroso (2017), which combined the split-decomposition, as exposed by Gioan and Paul, with analytic combinatorics, to produce new enumerative results on graphs---in particular the enumeration of several subclasses of perfect graphs (distance-hereditary, 3-leaf power, ptolemaic). Our goal was to study a simple family of graphs, of which the split-decomposition trees have prime nodes drawn from an enumerable (and manageable!) set of graphs. Cactus graphs, which we describe in more detail further down in this paper, can be thought of as trees with their edges replaced by cycles (of arbitrary lengths). Their split-decomposition trees contain prime nodes that are cycles, making them ideal to study. We derive a characterization for the split-decomposition trees of cactus graphs, produce a general template of symbolic grammars for cactus graphs, and implement random generation for these graphs, building on work by Iriza (2015).

[1]  Kalyani Das,et al.  Cactus Graphs and Some Algorithms , 2014, ArXiv.

[2]  Jérémie O. Lumbroso,et al.  Enumerations, Forbidden Subgraph Characterizations, and the Split-Decomposition , 2016, Electron. J. Comb..

[3]  Josef Kittler,et al.  Combinatorial Algorithms , 2016, Lecture Notes in Computer Science.

[4]  David Haussler,et al.  Cactus Graphs for Genome Comparisons , 2010, RECOMB.

[5]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[6]  Alain Denise,et al.  Uniform Random Generation of Decomposable Structures Using Floating-Point Arithmetic , 1999, Theor. Comput. Sci..

[7]  L. Chua,et al.  Topological criteria for nonlinear resistive circuits containing controlled sources to have a unique solution , 1984 .

[8]  Ira M. Gessel,et al.  Enumeration of Bipartite Graphs and Bipartite Blocks , 2013, Electron. J. Comb..

[9]  F Harary,et al.  On the Number of Husimi Trees: I. , 1953, Proceedings of the National Academy of Sciences of the United States of America.

[10]  Olivier Bodini,et al.  Analytic Samplers and the Combinatorial Rejection Method , 2015, ANALCO.

[11]  Michael Drmota,et al.  Systems of functional equations , 1997, Random Struct. Algorithms.

[12]  Jeremy P. Spinrad,et al.  Recognition of Circle Graphs , 1994, J. Algorithms.

[13]  Philip J. Hanlon,et al.  The enumeration of bipartite graphs , 1979, Discret. Math..

[14]  Gilbert Labelle,et al.  Combinatorial species and tree-like structures , 1997, Encyclopedia of mathematics and its applications.

[15]  Nellie Clarke Brown.  Trees , 1896, Savage Dreams.

[16]  R. Z. Norman,et al.  COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. I. , 1956, Proceedings of the National Academy of Sciences of the United States of America.

[17]  W. Cunningham.  Decomposition of Directed Graphs , 1982 .

[18]  COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. IV. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[19]  Alexander Iriza.  Enumeration and Random Generation of Unlabeled Classes of Graphs: A Practical Study of Cycle Pointing and the Dissymmetry Theorem , 2015, ArXiv.

[20]  Gilbert Labelle,et al.  Enumeration of m-Ary Cacti , 1998, Adv. Appl. Math..

[21]  Cédric Chauve,et al.  An Exact Enumeration of Distance-Hereditary Graphs , 2017, ANALCO.

[22]  Erik Jan van Leeuwen,et al.  Algorithms and Bounds for Very Strong Rainbow Coloring , 2017, LATIN.

[23]  G E Uhlenbeck,et al.  COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. II. , 1956, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Manuel Bodirsky,et al.  Boltzmann Samplers, Pólya Theory, and Cycle Pointing , 2010, SIAM J. Comput..

[25]  Murat Arcak,et al.  Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis , 2011, IEEE Transactions on Automatic Control.

[26]  Emeric Gioan,et al.  Split decomposition and graph-labelled trees: characterizations and fully-dynamic algorithms for totally decomposable graphs , 2008, Discret. Appl. Math..

[27]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[28]  Yann Ponty,et al.  GenRGenS: software for generating random genomic sequences and structures , 2006, Bioinform..

[29]  Philippe Flajolet,et al.  A Calculus for the Random Generation of Labelled Combinatorial Structures , 1994, Theor. Comput. Sci..

[30]  G. W. Ford,et al.  COMBINATORIAL PROBLEMS IN THE THEORY OF GRAPHS. III. , 1956, Proceedings of the National Academy of Sciences of the United States of America.

[31]  Dimitrios M. Thilikos,et al.  Parameterized complexity of finding a spanning tree with minimum reload cost diameter , 2017, IPEC.

[32]  Michèle Soria,et al.  Algorithms for combinatorial structures: Well-founded systems and Newton iterations , 2011, J. Comb. Theory, Ser. A.