Finding a hamilton path through a family of intervals

We develop an o(nx(n)) algorithm for computing a hamilton path in a family of n intervals, where x is an inverse of Ackerman's function. Our approach is based on a new characterization of interval graphs containing hamilton paths, related to the clique decomposition of the graph.

Saved in:

Bibliographic Details
Published in:	International journal of computer mathematics Vol. 51; no. 3-4; pp. 133 - 140
Main Authors:	Sridhar, M. A., Goyal, S.
Format:	Journal Article
Language:	English
Published:	Abingdon Gordon and Breach Science Publishers S.A 01.01.1994 Taylor and Francis
Subjects:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems Exact sciences and technology F.2.2 (analysis of algorithms and problem complexity) G.2.2 (discrete mathematics) hamilton paths Information retrieval. Graph interval families Interval graphs Theoretical computing Interval graph Graph decomposition Graph path Algorithm Computational complexity Hamiltonian path Target Search algorithm Interval
ISSN:	0020-7160, 1029-0265
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	We develop an o(nx(n)) algorithm for computing a hamilton path in a family of n intervals, where x is an inverse of Ackerman's function. Our approach is based on a new characterization of interval graphs containing hamilton paths, related to the clique decomposition of the graph.
ISSN:	0020-7160 1029-0265
DOI:	10.1080/00207169408804274