Finding Paths and Cycles of Superpolylogarithmic Length

DOI10.1137/S0097539704445366MaRDI QIDQ5432365zbMATH OpenDBLPWikidataFDO

Authors Harold N. Gabow

Publication date 3 January 2008

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmsgraph algorithmslong cycleslong paths

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Paths and cycles (05C38)

Recommendations

• Finding paths and cycles of superpolylogarithmic length
• Finding Long Paths, Cycles and Circuits
• Automata, Languages and Programming
• scientific article; zbMATH DE number 2086688
• Finding a Path of Superlogarithmic Length

Cited in

(15)

• An approximation algorithm for the longest path problem in solid grid graphs
• On the approximability of some degree-constrained subgraph problems
• Finding Long Paths, Cycles and Circuits
• Finding a Path of Superlogarithmic Length
• Automata, Languages and Programming
• The checkpoint problem
• Finding paths and cycles of superpolylogarithmic length
• Computing and Combinatorics
• scientific article; zbMATH DE number 2086688 (Why is no real title available?)
• The longest path problem is polynomial on cocomparability graphs
• Integer programming formulations for the elementary shortest path problem
• An approximation algorithm for the longest cycle problem in solid grid graphs
• A genetic algorithm for the picture maze generation problem
• Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
• Approximating long cycle above Dirac's guarantee

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 Q5432365)