Finding paths and cycles of superpolylogarithmic length

DOI10.1145/1007352.1007418zbMATH Open1192.68361OpenAlexW2031332216MaRDI QIDQ3581003FDOQ3581003

Authors: 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

Recommendations

• Finding Paths and Cycles of Superpolylogarithmic Length
• Finding a Path of Superlogarithmic Length
• scientific article; zbMATH DE number 2086688
• Longest paths and longest cycles in graphs with large degree sums
• On path-supermagic labelings of cycles
• Long paths and large cycles in finite graphs
• Paths and cycles of hypergraphs
• On relative length of longest paths and cycles
• Longest cycles in polyhedral graphs
• scientific article; zbMATH DE number 3937199

Mathematics Subject Classification ID

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

Cited In (15)

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

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

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