An algorithm for finding a fundamental set of cycles of a graph
From MaRDI portal
Publication:5568822
DOI10.1145/363219.363232zbMath0176.47205OpenAlexW2095458137MaRDI 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 (21)
The pin redistribution problem in multi-chip modules ⋮ Distance geometry and data science ⋮ Cycle-based formulations in distance geometry ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Enumeration of planar Tangles ⋮ Valid inequalities and facets for multi‐module survivable network design problem ⋮ A Round Trip Time Weighting Model for One-way Delay Estimation ⋮ Factoring Integers with Large-Prime Variations of the Quadratic Sieve ⋮ Parallel algorithms for connectivity problems in graph theory ⋮ An algorithm for the longest cycle problem ⋮ An application of rough sets to graph theory ⋮ Lower bounds for strictly fundamental cycle bases in grid graphs ⋮ Edge-swapping algorithms for the minimum fundamental cycle basis problem ⋮ A cycle-based formulation for the distance geometry problem ⋮ Minimum Cycle Bases and Their Applications ⋮ A comparison of three algorithms for finding fundamental cycles in a directed graph ⋮ Unnamed Item ⋮ Note on a modification of the fundamental cycles finding algorithm ⋮ Algorithms for finding minimum fundamental cycle bases in graphs ⋮ From graph theory to nano topology ⋮ A direct method for calculating cell cycles of a block map of a simple planar graph
This page was built for publication: An algorithm for finding a fundamental set of cycles of a graph
