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)
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
An approximation algorithm for the longest cycle problem in solid grid graphs, Integer programming formulations for the elementary shortest path problem, 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, The longest path problem is polynomial on cocomparability graphs, A genetic algorithm for the picture maze generation problem, An approximation algorithm for the longest path problem in solid grid graphs