Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- 27 December 1976
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 13 (3), 335-379
- https://doi.org/10.1016/s0022-0000(76)80045-1
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Computing an st-numberingTheoretical Computer Science, 1976
- An algorithm for testing chordality of graphsInformation Processing Letters, 1975
- Efficient Planarity TestingJournal of the ACM, 1974
- File organizationCommunications of the ACM, 1972
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- Triangulated graphs and the elimination processJournal of Mathematical Analysis and Applications, 1970
- Incidence matrices, interval graphs and seriation in archeologyPacific Journal of Mathematics, 1969
- Scheduling of traffic lights—A new approachTransportation Research, 1968
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961