A simple algorithm to find Hamiltonian cycles in proper interval graphs

DOI10.1016/J.IPL.2009.07.010zbMATH Open1197.05085OpenAlexW2059260882MaRDI QIDQ989586FDOQ989586

Authors: Louis Ibarra 

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.010

Recommendations

• Finding Hamiltonian circuits in interval graphs
• A linear time recognition algorithm for proper interval graphs
• An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs
• A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs

zbMATH Keywords

Hamiltonian cyclegraph algorithmsproper interval graphinterval graphChordal graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Title not available (Why is that?)
• Topics in Intersection Graph Theory
• Finding Hamiltonian circuits in proper interval graphs
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Proper interval graphs and the guard problem
• Algorithmic graph theory and perfect graphs
• Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
• Simple linear time recognition of unit interval graphs
• An Incremental Linear-Time Algorithm for Recognizing Interval Graphs
• The clique-separator graph for chordal graphs
• Title not available (Why is that?)
• Finding Hamiltonian circuits in interval graphs
• Title not available (Why is that?)
• The NP-completeness column: an ongoing guide
• Counting clique trees and computing perfect elimination schemes in parallel
• A Fully dynamic algorithm for recognizing and representing proper interval graphs
• A linear time recognition algorithm for proper interval graphs
• Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs
• A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
• An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals

Cited In (12)

• Title not available (Why is that?)
• Sitting closer to friends than enemies, revisited
• A data structure useful for finding Hamiltonian cycles
• Complexity of Steiner tree in split graphs -- dichotomy results
• An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs
• The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy
• Finding Hamiltonian circuits in interval graphs
• An optimum \(\Theta\) (n log n) algorithm for finding a canonical Hamiltonian path and a canonical Hamiltonian circuit in a set of intervals
• Kernelization of graph Hamiltonicity: proper \(H\)-graphs
• An algorithm for finding all Hamiltonian cycles in a simple graph via hierarchical correlation
• Complexity of Hamiltonian cycle reconfiguration
• 2-Trees: Structural insights and the study of Hamiltonian paths

This page was built for publication: A simple algorithm to find Hamiltonian cycles in proper interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989586)