Classes of cycle bases

@article{Liebchen2007ClassesOC,
  title={Classes of cycle bases},
  author={Christian Liebchen and R. Rizzi},
  journal={Discret. Appl. Math.},
  year={2007},
  volume={155},
  pages={337-355}
}
In the last years, new variants of the minimum cycle basis (MCB) problem and new classes of cycle bases have been introduced, as motivated by several applications from disparate areas of scientific and technological inquiries. At present, the complexity status of the MCB problem has been settled only for undirected, directed, and strictly fundamental cycle bases. In this paper, we offer an unitary classification accommodating these three classes and further including the following four relevant… Expand
Minimum Weakly Fundamental Cycle Bases Are Hard To Find
  • R. Rizzi
  • Computer Science, Mathematics
  • Algorithmica
  • 2007
TLDR
This paper settles the complexity status of the MCB problem for WFCB’s (the MWFCB problem) and offers a simple and practical 2⌈log 2n⌉-approximation algorithm for the MW FCB problem. Expand
Cycle bases in graphs characterization, algorithms, complexity, and applications
TLDR
The state of knowledge on cycle bases is surveyed, different kinds of cycle bases are introduced, characterized in terms of their cycle matrix, and structural results and a priori length bounds are proved. Expand
Improved Minimum Cycle Bases Algorithms by Restriction to Isometric Cycles
We present improved algorithms for finding minimum cycle bases in undirected and directed graphs. For general graphs, the new algorithms are Monte Carlo and have running time O(mω), where m is theExpand
New Approximation Algorithms for Minimum Cycle Bases of Graphs
TLDR
This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Θ(mω) bound, and two new algorithms to compute an approximate minimum cycle basis are presented. Expand
On a Special Co-cycle Basis of Graphs
TLDR
It is shown that the co-cycle basis corresponding to the cuts of a Gomory-Hu tree of the underlying undirected graph of G is a minimum co- cycle basis of Gand it is also weakly fundamental. Expand
New Approximation Algorithms for Minimum Cycle Bases of Graphs
TLDR
This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Θ(mω) bound, and two new algorithms to compute an approximate minimum cycle basis are presented. Expand
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs
TLDR
This work revisits Horton's and de Pina's approaches and proposes a simple hybrid algorithm which improves the worst-case complexity to O(m2n / logn) and presents a very efficient related algorithm that relies on an adaptive independence test a la de PINA. Expand
Properties of Gomory-Hu co-cycle bases
  • T. Kavitha
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 2012
TLDR
This work shows that the co- Cycle basis corresponding to the cuts of a Gomory-Hu tree T of the underlying undirected graph of D is a minimum weight weakly fundamental co-cycle basis of D and it is also totally unimodular. Expand
On the approximability of the minimum strictly fundamental cycle basis problem
TLDR
This paper shows that the problem of finding a strictly fundamental cycle basis of minimum weight in the cycle space associated with an undirected connected graph G is APX-hard, even when restricted to unweighted graphs, and hence does not admit a polynomial-time approximation scheme, unless P = NP. Expand
Minimum Cycle Basis, Algorithms & Applications
We consider the problem of computing a minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices. In this problem, a {0, 1} incidence vector is associated with each cycleExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 49 REFERENCES
On the Approximability of the Minimum Fundamental Cycle Basis Problem
TLDR
The problem of finding a fundamental cycle basis of minimum total weight in the cycle space associated with an undirected biconnected graph G is shown to be MAXSNP-hard and hence does not admit a polynomial-time approximation scheme (PTAS) unless P=NP; the first upper bounds on the approximability of the problem are derived. Expand
A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
TLDR
This work considers the problem of computing a minimum cycle basis in a directed graph G whose edges have non-negative weights and presents an O(m3n + m2n2logn) algorithm, a slightly improved running time improvement of the current fastest randomized algorithm. Expand
A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
  • J. Horton
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1987
TLDR
An algorithm is given that finds a cycle basis with the shortest possible length in $O(m^3 n)$ operations, which is the first known polynomial-time algorithm for this problem. Expand
A Faster Algorithm for Minimum Cycle Basis of Graphs
TLDR
A 1-e approximation algorithm to compute a cycle basis which is at most 1+e times the weight of a minimum cycle basis in a graph G with m edges and n vertices. Expand
Algorithms for Generating Fundamental Cycles in a Graph
TLDR
It is shown that for regular graphs of order n the expected value of the total length of a minimum fundamentalcycle set does not exceed O(n2). Expand
Minimum Cycle Bases for Network Graphs
TLDR
A new combinatorial approach is presented which generates minimum cycle bases in time O(\max{|E|3,|E||V|2log |V|}) with a space requirement of Θ(|E |2). Expand
A greedy approach to compute a minimum cycle basis of a directed graph
TLDR
A very simple exact algorithm of complexity O(m4n), being as fast as the first algorithm proposed for this problem, and it is proved that these greedy approaches fail for more specialized subclasses of directed cycle bases. Expand
A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
TLDR
An O(m4n) algorithm is given, which is the first polynomial time algorithm for this problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. Expand
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
TLDR
This work proposes new heuristics (local search and metaheuristics) in which edge swaps are iteratively applied to a current spanning tree, and presents a mixed integer programming formulation of the problem whose linear relaxation yields tighter lower bounds than known formulations. Expand
A Linear Time Implementation of SPQR-Trees
TLDR
The relationship between SPQR-trees and triconnected components is described and the incorrectness of the Hopcroft and Tarjan algorithm is shown and the resulting algorithm is applied to the computation of SPQRs. Expand
...
1
2
3
4
5
...