New sequential and parallel algorithms for interval graph recognition
References (12)
Total domination in interval graphs
Inform. Process. Lett.
(1986)- et al.
Some parallel algorithms on interval graphs
Discrete Appl. Math.
(1987) - et al.
Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms
J. Comput. System Sci.
(1976) Finding Hamiltonian circuits in interval graphs
Inform. Process. Lett.
(1985)- et al.
A unified approach to domination problems on interval graphs
Inform. Process. Lett.
(1988) Algorithm Graph Theory and Perfect Graphs
(1980)
There are more references available in the full text version of this article.
Cited by (6)
A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
2009, Information Processing LettersEfficient algorithms for the domination problems on interval and circular-arc graphs
1998, SIAM Journal on ComputingAccelerating Computation of Steiner Trees on GPUs
2022, International Journal of Parallel ProgrammingCharacterization and recognition of point-halfspace and related orders
1995, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Gossiping on interval graphs (computer networks)
1993, Proceedings of 7th International Parallel Processing Symposium, IPPS 1993Routing algorithms in interval and circular-arc networks
1991, Proceedings - 5th International Parallel Processing Symposium, IPPS 1991
- ∗
Currently at Computer Sciences Department, University of Wisconsin-Madison, Madison, WI 53706.
Copyright © 1990 Published by Elsevier B.V.