An algorithm for finding a fundamental set of cycles of a graph
From MaRDI portal
Publication:5568822
DOI10.1145/363219.363232zbMath0176.47205MaRDI QIDQ5568822
Publication date: 1969
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/363219.363232
Related Items
Factoring Integers with Large-Prime Variations of the Quadratic Sieve, Unnamed Item, Counting single-qubit Clifford equivalent graph states is #P-complete, Lower bounds for strictly fundamental cycle bases in grid graphs, An application of rough sets to graph theory, Edge-swapping algorithms for the minimum fundamental cycle basis problem, The pin redistribution problem in multi-chip modules, Note on a modification of the fundamental cycles finding algorithm, Distance geometry and data science, Enumeration of planar Tangles, Algorithms for finding minimum fundamental cycle bases in graphs, Minimum Cycle Bases and Their Applications, Parallel algorithms for connectivity problems in graph theory, A comparison of three algorithms for finding fundamental cycles in a directed graph, An algorithm for the longest cycle problem