Finding paths and cycles of superpolylogarithmic length

DOI10.1145/1007352.1007418zbMath1192.68361OpenAlexW2031332216MaRDI QIDQ3581003

Harold N. Gabow

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1007352.1007418

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38)

Related Items (11)

The Longest Path Problem Is Polynomial on Interval Graphs ⋮ An Improved Algorithm for Finding Cycles Through Elements ⋮ The longest path problem has a polynomial solution on interval graphs ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ Not being (super)thin or solid is hard: A study of grid Hamiltonicity ⋮ Algorithm engineering for color-coding with applications to signaling pathway detection ⋮ Finding large cycles in Hamiltonian graphs ⋮ The Longest Path Problem is Polynomial on Cocomparability Graphs ⋮ Approximating the maximum clique minor and some subgraph homeomorphism problems ⋮ A linear-time algorithm for the longest path problem in rectangular grid graphs ⋮ On a simple randomized algorithm for finding a 2-factor in sparse graphs

This page was built for publication: Finding paths and cycles of superpolylogarithmic length