Finding Hamiltonian circuits in proper interval graphs
- 24 August 1983
- journal article
- Published by Elsevier BV in Information Processing Letters
- Vol. 17 (2), 97-101
- https://doi.org/10.1016/0020-0190(83)90078-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The edge Hamiltonian path problem is NP-completeInformation Processing Letters, 1981
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc GraphsSIAM Journal on Algebraic Discrete Methods, 1981
- Minimum node disjoint path covering for circular-arc graphsInformation Processing Letters, 1979
- On the complexity of computing the measure of ∪[a i ,b i ]Communications of the ACM, 1978
- A Survey of Analysis Techniques for Discrete AlgorithmsACM Computing Surveys, 1977
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- An NP-hard problem in bipartite graphsACM SIGACT News, 1975
- Algorithms on circular-arc graphsNetworks, 1974
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- Scheduling of traffic lights—A new approachTransportation Research, 1968