On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
From MaRDI portal
Publication:4240135
DOI10.1006/jagm.1998.0998zbMath0919.05039OpenAlexW2027410688MaRDI QIDQ4240135
Zsolt Tuza, Miklos Santha, Cristina Bazgan
Publication date: 31 August 1999
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3b98d5e3683614bedc3d3ee590095549cb4f64bb
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)
Related Items
Spanning spiders and light-splitting switches ⋮ Optimal multi-TDMA scheduling in ring topology networks ⋮ Algorithms for long paths in graphs ⋮ Optimizing concurrency under Scheduling by Edge Reversal ⋮ Approximating Alternative Solutions ⋮ Hardness of bounding influence via graph modification ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Finding large cycles in Hamiltonian graphs ⋮ Unnamed Item ⋮ Approximating the longest paths in grid graphs ⋮ Aspects of upper defensive alliances ⋮ On the Power of Planned Infections in Networks ⋮ An approximation algorithm for the maximum spectral subgraph problem ⋮ Approximability of the upper chromatic number of hypergraphs
