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.

Uloženo v:
Podrobná bibliografie
Vydáno v:International journal of computer mathematics Ročník 51; číslo 3-4; s. 133 - 140
Hlavní autoři: Sridhar, M. A., Goyal, S.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Abingdon Gordon and Breach Science Publishers S.A 01.01.1994
Taylor and Francis
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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