An algorithm for finding a fundamental set of cycles of a graph

DOI10.1145/363219.363232MaRDI QIDQ5568822zbMATH OpenOpenAlexFDO

Authors Keith Paton

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

zbMATH Keywords

numerical analysis

Cited in

(22)

• 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
• A cycle-based formulation for the distance geometry problem
• 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
• Factoring Integers with Large-Prime Variations of the Quadratic Sieve
• Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
• Generating weighted MAX-2-SAT instances with frustrated loops: an RBM case study
• Lower bounds for strictly fundamental cycle bases in grid graphs
• From graph theory to nano topology
• A direct method for calculating cell cycles of a block map of a simple planar graph
• Cycle-based formulations in distance geometry
• Valid inequalities and facets for multi‐module survivable network design problem
• A Round Trip Time Weighting Model for One-way Delay Estimation
• An application of rough sets to graph theory
• Scattering theory for Stokes flow in complex branched structures

This page was built for publication: An algorithm for finding a fundamental set of cycles of a graph

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