On finding cycle bases and fundamental cycle bases with a shortest maximal cycle-Reference-Cited by-同舟云学术

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

Published:2003-11 Issue:4 Volume:88 Page:155-159
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Galbiati Giulia

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference6 articles.

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. On finding a cycle basis with a shortest maximal cycle;Chickering;Inform. Process. Lett.,1995

3. A polynomial-time algorithm to find the shortest cycle basis of a graph;Horton;SIAM J. Comput.,1987

4. On optimum cycle bases;Galbiati,2001

5. Local computations with probabilities on graphical structures and their applications to expert systems;Lauritzen;J. Roy. Statist. Soc. Ser. B,1988

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Tree 3-Spanners on Generalized Prisms of Graphs;LATIN 2022: Theoretical Informatics;2022

2. Hardness and efficiency on t-admissibility for graph operations;Discrete Applied Mathematics;2021-12

3. The Minimum Stretch Spanning Tree Problem for Typical Graphs;Acta Mathematicae Applicatae Sinica, English Series;2021-07

4. Optimality computation of the minimum stretch spanning tree problem;Applied Mathematics and Computation;2020-12

5. The Minimum Stretch Spanning Tree Problem for Hamming Graphs and Higher-Dimensional Grids;Journal of Interconnection Networks;2020-03