An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph
- 1 November 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (4), 797-808
- https://doi.org/10.1137/0210062
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On cycle bases of a graphNetworks, 1979
- On Algorithms for Enumerating All Circuits of a GraphSIAM Journal on Computing, 1976
- An algorithm for the longest cycle problemNetworks, 1976
- Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning TreesNetworks, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- GRAPH THEORYPublished by Defense Technical Information Center (DTIC) ,1969