An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph

DOI10.1137/0210062zbMath0468.68070OpenAlexW1965919443MaRDI QIDQ3922183

Maciej M. Sysło

Publication date: 1981

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0210062

zbMATH Keywords

planar graphcycle basiscycle graphall-cycle algorithmcycle space method

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (6)

The complexity of pebbling reachability and solvability in planar and outerplanar graphs ⋮ Dominating cycles in Halin graphs ⋮ Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion ⋮ An algorithm for finding a circuit of even length in a directed graph ⋮ A note on fundamental, non-fundamental, and robust cycle bases ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

This page was built for publication: An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph