A simple algorithm to find Hamiltonian cycles in proper interval graphs

Authors:
Louis Ibarra
Affiliations:
College of Computing and Digital Media, DePaul University, Chicago, IL 60604, USA
Venue:
Information Processing Letters
Year:
2009

Citing 13
Cited 2

An incremental linear-time algorithm for recognizing interval graphs

SIAM Journal on Computing
Counting clique trees and computing perfect elimination schemes in parallel

Information Processing Letters
An optimum &Tgr;(n log n) algorithm for finding a canonical Hamiltonian path and canonical Hamiltonian circuit in a set of intervals

Information Processing Letters
Simple linear time recognition of unit interval graphs

Information Processing Letters
Proper interval graphs and the guard problem

Discrete Mathematics
Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs

SIAM Journal on Computing
The ultimate interval graph recognition algorithm?

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs

SIAM Journal on Computing
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs

SIAM Journal on Computing
A linear time recognition algorithm for proper interval graphs

Information Processing Letters
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
The clique-separator graph for chordal graphs

Discrete Applied Mathematics
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Sitting closer to friends than enemies, revisited

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an algorithm to find a Hamiltonian cycle in a proper interval graph in O(m+n) time, where m is the number of edges and n is the number of vertices in the graph. The algorithm is simpler and shorter than previous algorithms for the problem.