Approximating the Longest Cycle Problem in Sparse Graphs
From MaRDI portal
Recommendations
- Computing and Combinatorics
- Approximating Longest Cycles in Graphs with Bounded Degrees
- Cycle lengths in sparse graphs
- An approximation algorithm for the longest cycle problem in solid grid graphs
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Longest cycles in sparse random digraphs
- Tight hardness for shortest cycles and paths in sparse graphs
- Automata, Languages and Programming
- Listing all fixed-length simple cycles in sparse graphs in optimal time
Cited in
(16)- Approximating the maximum clique minor and some subgraph homeomorphism problems
- On a simple randomized algorithm for finding a 2-factor in sparse graphs
- Listing all fixed-length simple cycles in sparse graphs in optimal time
- The longest cycle problem is polynomial on interval graphs
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Theory and application of reciprocal transformation of “path problem” and “time float problem”
- Understanding chicken walks on n × n grid: Hamiltonian paths, discrete dynamics, and rectifiable paths
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
- Spotting trees with few leaves
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- Computing and Combinatorics
- A Lower Bound on Cycle-Finding in Sparse Digraphs
- Approximating long cycle above Dirac's guarantee
- Approximating the longest paths in grid graphs
- Cycle lengths in sparse graphs
- Finding large cycles in Hamiltonian graphs
This page was built for publication: Approximating the Longest Cycle Problem in Sparse Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149885)
