Finding Long Paths, Cycles and Circuits
From MaRDI portal
Publication:3597877
DOI10.1007/978-3-540-92182-0_66zbMath1183.05078OpenAlexW1548700236WikidataQ56639260 ScholiaQ56639260MaRDI QIDQ3597877
Publication date: 29 January 2009
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_66
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (11)
An approximation algorithm for the longest cycle problem in solid grid graphs ⋮ Finding Two Edge-Disjoint Paths with Length Constraints ⋮ The Longest Path Problem Is Polynomial on Interval Graphs ⋮ The longest path problem is polynomial on cocomparability graphs ⋮ The longest path problem has a polynomial solution on interval graphs ⋮ Unnamed Item ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ The Longest Path Problem is Polynomial on Cocomparability Graphs ⋮ A genetic algorithm for the picture maze generation problem ⋮ A linear-time algorithm for the longest path problem in rectangular grid graphs ⋮ Two edge-disjoint paths with length constraints
This page was built for publication: Finding Long Paths, Cycles and Circuits
