article

Free access

Algorithms for Generating Fundamental Cycles in a Graph

Editor: John R. Rice Authors:

Narsingh Deo,

G. Prabhu,

M. S. KrishnamoorthyAuthors Info & Claims

ACM Transactions on Mathematical Software (TOMS), Volume 8, Issue 1

Pages 26 - 42

https://doi.org/10.1145/355984.355988

Published: 01 March 1982 Publication History

PDF eReader

References

[1]

AHo, A.V., HOPCROFT, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Algor~. thins Addison-Wesley, Reading, Mass., 1974.

Crossref

Google Scholar

[2]

CORNEIL, D B., AND READ, R C. The graph isomorphism disease J Gr. Theory I (1977), 339- 363.

Google Scholar

[3]

DF~O, N. Graph Theory wtth Applwattons to Engtneertng and Computer Science. Prentice- Hall, Englewood Cliffs, N J., 1974.

Google Scholar

[4]

DEO, N. Breadth and depth first searches in graph theoretic algorithms J. Comput. Soc India 4 (1974), 1-8.

Google Scholar

[5]

DEo, N. Minimum-length fundamental cycle set. IEEE Trans. Cwcuits Systems CAS~26 (Oct 1979), 894-895.

Google Scholar

[6]

GAREY, M.R., AND JOHNSON, D.S. Computers and Intractabdity: A Guide to the Theory of NP- Completeness. W.H. Freeman, San Francisco, 1979.

Crossref

Google Scholar

[7]

GIBBS, N.W. Algorithm 491: Basic cycle generation Commun ACM 18, 5 (May 1975), 275-276.

Crossref

Google Scholar

[8]

GOTLIEB, C.C., AND CORNEIL, D.G. Algorithms for finding a fundamental set of cycles for an undirected linear graph. Commun. ACM 10, 12 (Dec. 1967), 780-783.

Crossref

Google Scholar

[9]

HARARY, F. Graph Theory. Addison-Wesley, Reading, Mass, 1969.

Google Scholar

[10]

HUBICKA, E., AND SYSLO, M.M. Minimal bases of cycles of a graph. In Proc 2nd Czechoslovak Symp. Graph Theory. Academia (Prague, 1975), pp. 283-293.

Google Scholar

[11]

ITO, T., AND KIZAWA, M. The matrix rearrangement procedure for graph-theoretical algorithms and its application to the generation of fundamental cycles. ACM Trans. Math. Softw. 3, 3 (Sept 1977), 227-231.

Crossref

Google Scholar

[12]

JOHSSON, D.S., LENSTRA, J.D., AND R1NNOOY KAN, A.H.G. The complexity of the network design problem. Networks 8 (1978).

Google Scholar

[13]

JOVANOVICH, A.D. Note on a modification of the fundamental cycle finding algorithm. Inf. Process. Lett. 3 (July 1974).

Google Scholar

[14]

KNUTH, D.E. The Art of Computer Programming, vol. I. Addison-Wesley, Reading, Mass., 1968, pp. 363-368.

Crossref

Google Scholar

[15]

KOLASINSKA, E. On a minimum cycle basis of a graph. Zastosow Matem 16 (1980), 631-639.

Google Scholar

[16]

LEDER~.RG, J. Topology of Molecules. Mathematwal Sciences, M.I.T. Press, Cambridge, Mass., 1968, 37-51.

Google Scholar

[17]

PATON, K. An algorithm for finding a fundamental set of cycles of a graph. Commun. A CM 12, 9 (Sept. 1969), 514-518.

Crossref

Google Scholar

[18]

REINGOLD, E.M, NIEVERGELT, j., AND DEO, N. Combmatortal Algorithms: Theory and Practice. Prentice-Hall, Englewood Cliffs, N.J., 1977.

Crossref

Google Scholar

[19]

STEPANEC, G.F. Basis systems of vector cycles with extremal properties in graphs (m Russian), Usp. Mat. Nauk 19, 2 (116) (1964), 171-175.

Google Scholar

[20]

SUSSENGUTH, E., JR. A graph theoretical algorithm for matching chemical structures. J. Chem. Doc. 5, 1 (Feb. 1965), 36-43.

Google Scholar

[21]

SYSLO~ M.M. Fundamental set of cycles of a graph. Zastosow Matem 13 (1973), 399-409.

Google Scholar

[22]

SYSLO, M.M. Minimum-length cycle bases of a graph (Extended Abstract). Methods Oper. Res. 37 (1980), 385-390.

Google Scholar

[23]

TA~AN, R.E. Depth-first search and linear graph algorithms. SIAM J. Comput. 1 (1972), 146- 160.

Google Scholar

[24]

TINHOFER, G. Zufallsgraphen. Hanser, Munich, 1980.

Google Scholar

[25]

WELCH, J.T., J~. A mechanical analysis of the cyclic structure of undirected |meat graphs. J. ACM 13, 2 (1966), 205-210.

Crossref

Google Scholar

[26]

Z'~KOV, A.A. Theory of Fmae Graphs (in Russmn). Nauka, Novosibirsk, 1969.

Google Scholar

Cited By

View all

Yang HXie ZShan LLi LWang XDong Z(2025)Multi-level structures in cemented granular materials from digital image processing and complex network theoryPowder Technology10.1016/j.powtec.2024.120579452(120579)Online publication date: Feb-2025
https://doi.org/10.1016/j.powtec.2024.120579
Su T(2024)Minimum spanning tree cycle intersection problem on outerplanar graphsDiscrete Applied Mathematics10.1016/j.dam.2023.11.011343(328-339)Online publication date: Jan-2024
https://doi.org/10.1016/j.dam.2023.11.011
Liberti LIommazzo GLavor CMaculan N(2023)Cycle-based formulations in Distance GeometryOpen Journal of Mathematical Optimization10.5802/ojmo.184(1-16)Online publication date: 10-Jan-2023
https://doi.org/10.5802/ojmo.18
Show More Cited By

Index Terms

Algorithms for Generating Fundamental Cycles in a Graph
1. Theory of computation
  1. Computational complexity and cryptography
    1. Problems, reductions and completeness

Recommendations

Odd cycles and Θ-cycles in hypergraphs

A @Q-cycle of a hypergraph is a cycle including an edge that contains at least three base points of the cycle. We show that if a hypergraph H=(V,E) has no @Q-cycle, and |e|>=3, for every edge e@__ __E, then @__ __"e"@__ __"E(|e|-1)=<2|V|-2 with equality ...
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

An efficient method to generate all edge sets X@__ __E of a graph G=(V,E), which are vertex-disjoint unions of cycles, is presented. It can be tweaked to generate (i) all cycles, (ii) all cycles of cardinality =<5, (iii) all chordless cycles, (iv) all ...
The rainbow numbers of cycles in maximal bipartite planar graph
Abstract
Let B n denote the family of all maximal bipartite planar graphs on n vertices. Given a family of graphs H, let B n ( H ) denote the family of all maximal bipartite planar graphs on n vertices which are not H-free. For graph G and a family of ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Mathematical Software

ACM Transactions on Mathematical Software Volume 8, Issue 1

March 1982

89 pages

ISSN:0098-3500

EISSN:1557-7295

DOI:10.1145/355984

Editor:
John R. Rice

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1982

Published in TOMS Volume 8, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

86
Total Citations
View Citations
1,899
Total Downloads

Downloads (Last 12 months)200
Downloads (Last 6 weeks)22

Reflects downloads up to 15 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Yang HXie ZShan LLi LWang XDong Z(2025)Multi-level structures in cemented granular materials from digital image processing and complex network theoryPowder Technology10.1016/j.powtec.2024.120579452(120579)Online publication date: Feb-2025
https://doi.org/10.1016/j.powtec.2024.120579
Su T(2024)Minimum spanning tree cycle intersection problem on outerplanar graphsDiscrete Applied Mathematics10.1016/j.dam.2023.11.011343(328-339)Online publication date: Jan-2024
https://doi.org/10.1016/j.dam.2023.11.011
Liberti LIommazzo GLavor CMaculan N(2023)Cycle-based formulations in Distance GeometryOpen Journal of Mathematical Optimization10.5802/ojmo.184(1-16)Online publication date: 10-Jan-2023
https://doi.org/10.5802/ojmo.18
Sengupta SPeri SAggarwal VGupta A(2022)A Heuristic for Constructing Minimum Average Stretch Spanning Tree Using Betweenness Centrality2022 30th Euromicro International Conference on Parallel, Distributed and Network-based Processing (PDP)10.1109/PDP55904.2022.00019(67-74)Online publication date: Mar-2022
https://doi.org/10.1109/PDP55904.2022.00019
Scott JTůma M(2022)A null-space approach for large-scale symmetric saddle point systems with a small and non zero (2, 2) blockNumerical Algorithms10.1007/s11075-021-01245-z90:4(1639-1667)Online publication date: 1-Aug-2022
https://dl.acm.org/doi/10.1007/s11075-021-01245-z
Sengupta SPeri SAnjana P(2022)A Self-stabilizing Minimum Average Stretch Spanning Tree ConstructionNetworked Systems10.1007/978-3-031-17436-0_9(119-135)Online publication date: 17-May-2022
https://dl.acm.org/doi/10.1007/978-3-031-17436-0_9
Bai FVidal-Calleja TGrisetti G(2021)Sparse Pose Graph Optimization in Cycle SpaceIEEE Transactions on Robotics10.1109/TRO.2021.305032837:5(1381-1400)Online publication date: Oct-2021
https://doi.org/10.1109/TRO.2021.3050328
Dubinsky MMassri CTaubin G(2021)tinygarden — A java package for testing properties of spanning treesSoftware Impacts10.1016/j.simpa.2021.1000839(100083)Online publication date: Aug-2021
https://doi.org/10.1016/j.simpa.2021.100083
Dubinsky MMassri CTaubin G(2021)Minimum Spanning Tree Cycle Intersection problemDiscrete Applied Mathematics10.1016/j.dam.2021.01.031294(152-166)Online publication date: May-2021
https://doi.org/10.1016/j.dam.2021.01.031
Rusnak LTešić J(2021)Characterizing attitudinal network graphs through frustration cloudData Mining and Knowledge Discovery10.1007/s10618-021-00795-z35:6(2498-2539)Online publication date: 1-Nov-2021
https://dl.acm.org/doi/10.1007/s10618-021-00795-z
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Odd cycles and Θ-cycles in hypergraphs

Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion

The rainbow numbers of cycles in maximal bipartite planar graph

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations