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

DOI10.1145/363848.363861zbMath0158.34705OpenAlexW2069151075MaRDI QIDQ5541597

Calvin C. Gotlieb, Derek Gordon 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

Related Items (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