Rooted Cycle Bases

A cycle basis in an undirected graph is a minimal set of simple cycles whose symmetric differences include all Eulerian subgraphs of the given graph. We define a rooted cycle basis to be a cycle basis in which all cycles contain a specified root edge, and we investigate the algorithmic problem of constructing rooted cycle bases. We show that a given graph has a rooted cycle basis if and only if the root edge belongs to its 2-core and the 2-core is 2-vertex-connected, and that constructing such a basis can be performed efficiently. We show that in an unweighted or positively weighted graph, it is possible to find the minimum weight rooted cycle basis in polynomial time. Additionally, we show that it is NP-complete to find a fundamental rooted cycle basis (a rooted cycle basis in which each cycle is formed by combining paths in a fixed spanning tree with a single additional edge) but that the problem can be solved by a fixed-parameter-tractable algorithm when parameterized by clique-width.

[1]  H. Whitney.  Non-Separable and Planar Graphs. , 1931, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Audrey Lee-St. John,et al.  Pebble game algorithms and sparse graphs , 2007, Discret. Math..

[3]  Ali Kaveh,et al.  Improved cycle bases for the flexibility analysis of structures , 1976 .

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

[5]  Vijaya Ramachandran.  Parallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity , 1993 .

[6]  Mikkel Thorup,et al.  Dynamic ordered sets with exponential search trees , 2002, J. ACM.

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  James G. Oxley,et al.  Matroid theory , 1992 .

[9]  David S. Johnson,et al.  Computers and Inrracrobiliry: A Guide ro the Theory of NP-Completeness , 1979 .

[10]  David Eppstein,et al.  Dynamic generators of topologically embedded graphs , 2002, SODA '03.

[11]  Romeo Rizzi,et al.  New length bounds for cycle bases , 2007, Inf. Process. Lett..

[12]  Kurt Mehlhorn,et al.  Cycle bases in graphs characterization, algorithms, complexity, and applications , 2009, Comput. Sci. Rev..

[13]  László Lovász,et al.  Cycles through specified vertices of a graph , 1981, Comb..

[14]  Manfred Hiller,et al.  Symbolic Processing of Multiloop Mechanism Dynamics Using Closed-Form Kinematics Solutions , 1997 .

[15]  J. W. Suurballe.  Disjoint paths in a network , 1974, Networks.

[16]  David Eppstein,et al.  Automated Generation of Linkage Loop Equations for Planar One Degree-of-Freedom Linkages, Demonstrated up to 8-Bar , 2015 .

[17]  Sorin Istrail,et al.  HapCompass: A Fast Cycle Basis Algorithm for Accurate Haplotype Assembly of Sequence Data , 2012, J. Comput. Biol..

[18]  Christian Liebchen,et al.  Periodic Timetable Optimization in Public Transport , 2006, OR.

[19]  Franck Petit,et al.  When graph theory helps self-stabilization , 2004, PODC '04.

[20]  Joseph Douglas Horton,et al.  A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph , 1987, SIAM J. Comput..

[21]  Kurt Mehlhorn,et al.  Implementing minimum cycle basis algorithms , 2007, JEAL.

[22]  W. T. Tutte.  On the 2-factors of bicubic graphs , 1971, Discret. Math..

[23]  David Eppstein,et al.  Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph. , 1993 .

[24]  Romeo Rizzi,et al.  Minimum Weakly Fundamental Cycle Bases Are Hard To Find , 2009, Algorithmica.

[25]  François Major,et al.  Automated extraction and classification of RNA tertiary structure cyclic motifs , 2006, Nucleic acids research.

[26]  Bruno Courcelle,et al.  Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width , 1998, WG.

[27]  László Lovász,et al.  Computing ears and branchings in parallel , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[28]  Edoardo Amaldi,et al.  Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs , 2010, IPCO.