An algorithm for the longest cycle problem

DOI10.1002/net.3230060206zbMath0339.90039OpenAlexW2129090681WikidataQ126263515 ScholiaQ126263515MaRDI QIDQ4108141

S. Goodman, E. T. Dixon

Publication date: 1976

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230060206

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)

Related Items

Graph bases and diagram commutativity ⋮ Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\) ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Methods for determining cycles of a specific length in undirected graphs with edge weights ⋮ A note on fundamental, non-fundamental, and robust cycle bases ⋮ Minor and minimum cycle bases of a 3-connected planar graph

Cites Work

• An algorithm for finding a fundamental set of cycles of a graph
• Unnamed Item