Algorithms for finding a fundamental set of cycles for an undirected linear graph

DOI10.1145/363848.363861MaRDI QIDQ5541597zbMATH OpenOpenAlexFDO

Authors Calvin C. Gotlieb, Derek G. Corneil

Publication date 1967

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/363848.363861

zbMATH Keywords

numerical analysis

Cited in

(2)

• Parallel algorithms for connectivity problems in graph theory
• Lower bounds for strictly fundamental cycle bases in grid graphs

This page was built for publication: Algorithms for finding a fundamental set of cycles for an undirected linear graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5541597)