On finding cycle bases and fundamental cycle bases with a shortest maximal cycle

Information Processing Letters

Volumn 88, Issue 4, 2003, Pages 155-159

  Galbiati, Giulia ^a  

^a UNIVERSITY OF PAVIA   (Italy)

Author keywords

Algorithms; Approximation algorithms; Combinatorial problems; Computational complexity; Cycle basis

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATION ALGORITHMS;

COMPUTATIONAL COMPLEXITY;

EID: 0142043284     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.07.003     Document Type: Article

References (6)

1. A. Bley, M. Grotschel, R. Wessaly, Design of broadband virtual private networks: Model and heuristics for the B-win, Konrad-Zuse-Zentrum für Informationstechnik, Berlin, 1998, Preprint.
2. Chickering D.M., Geiger D., Heckerman D. On finding a cycle basis with a shortest maximal cycle. Inform. Process. Lett. 54:1995;55-58.
3. Horton J.D. A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM J. Comput. 16:(2):1987;358-366.
4. Galbiati G. On optimum cycle bases. Nesetril J., Noy M., Serra O. Electronic Notes in Discrete Mathematics. 10:2001;Elsevier Science Publishers, Amsterdam.
5. Lauritzen S.L., Spiegelhalter D.J. Local computations with probabilities on graphical structures and their applications to expert systems. J. Roy. Statist. Soc. Ser. B. 50:1988;157-224.
6. Syslo M.M. On cycle bases of a graph. Networks. 9:1979;123-132.