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 \(\mathsf {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]  Kurt Mehlhorn,et al.  Cycle bases in graphs characterization, algorithms, complexity, and applications , 2009, Comput. Sci. Rev..

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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