On the longest circuit in an alterable digraph

DOI10.1007/BF01279452MaRDI QIDQ1904653zbMATH OpenOpenAlexFDO

Authors Chih-Long Lin, Ker-I Ko

Publication date 1 February 1996

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01279452

zbMATH Keywords

alterable digraphapproximationglobal optimizationNP-hardness

Mathematics Subject Classification ID

Nonlinear programming (90C30) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 3948312
• Finding Long Paths, Cycles and Circuits
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’
• A numerical approach to long cycles in graphs and digraphs
• Automata, Languages and Programming

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• On the hardness of approximating minimization problems
• Optimization, approximation, and complexity classes
• Probabilistically checkable debate systems and approximation algorithms for PSPACE-hard functions
• The polynomial-time hierarchy
• The Traveling Salesman Problem with Distances One and Two

Cited in

(2)

• In Memoriam: Ker-I Ko (1950–2018)
• An extension to ‘an algorithm for rinding a circuit of even length in a directed graph’

This page was built for publication: On the longest circuit in an alterable digraph

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