Finding Paths and Cycles of Superpolylogarithmic Length
From MaRDI portal
Publication:5432365
DOI10.1137/S0097539704445366zbMath1135.68044WikidataQ56639261 ScholiaQ56639261MaRDI QIDQ5432365
Publication date: 3 January 2008
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (8)
An approximation algorithm for the longest cycle problem in solid grid graphs ⋮ Integer programming formulations for the elementary shortest path problem ⋮ The longest path problem is polynomial on cocomparability graphs ⋮ On the approximability of some degree-constrained subgraph problems ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ The checkpoint problem ⋮ A genetic algorithm for the picture maze generation problem ⋮ An approximation algorithm for the longest path problem in solid grid graphs
This page was built for publication: Finding Paths and Cycles of Superpolylogarithmic Length
