An algorithm for the longest cycle problem

DOI10.1002/NET.3230060206MaRDI QIDQ4108141zbMATH OpenOpenAlexWikidataFDO

Authors E. T. Dixon, S. Goodman

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

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

Cites work

• An algorithm for finding a fundamental set of cycles of a graph
• scientific article; zbMATH DE number 3299758 (Why is no real title available?)

Cited in

(8)

• A note on fundamental, non-fundamental, and robust cycle bases
• Minor and minimum cycle bases of a 3-connected planar graph
• Robust cycle bases do not exist for \(K_{n, n}\) if \(n \geq 8\)
• Graph bases and diagram commutativity
• Exact Solution Algorithms for the Chordless Cycle Problem
• Methods for determining cycles of a specific length in undirected graphs with edge weights
• Formulations and algorithms for the simple cycle problem
• Extended formulation and branch-and-cut-and-price algorithm for the two connected subgraph problem with disjunctive constraints

This page was built for publication: An algorithm for the longest cycle problem

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