A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
From MaRDI portal
Cites work
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3167398 (Why is no real title available?)
- scientific article; zbMATH DE number 3228308 (Why is no real title available?)
- scientific article; zbMATH DE number 3229058 (Why is no real title available?)
Cited in
(7)- Finding all the negative cycles in a directed graph
- Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem
- Node flows in graphs with conservative flow
- Parallel algorithms for connectivity problems in graph theory
- A direct method for calculating cell cycles of a block map of a simple planar graph
- An application of rough sets to graph theory
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
This page was built for publication: A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5514304)