NC algorithms for comparability graphs, interval graphs, and testing for unique perfect matching
- 1 January 1985
- book chapter
- Published by Springer Nature
- p. 496-503
- https://doi.org/10.1007/3-540-16042-6_28
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- The two-processor scheduling problem is in R-NCPublished by Association for Computing Machinery (ACM) ,1985
- A simple parallel algorithm for the maximal independent set problemPublished by Association for Computing Machinery (ACM) ,1985
- A fast parallel algorithm for the maximal independent set problemPublished by Association for Computing Machinery (ACM) ,1984
- Parallel computation for well-endowed rings and space-bounded probabilistic machinesInformation and Control, 1983
- Comparability graphs and a new matroidJournal of Combinatorial Theory, Series B, 1977
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- The Factors of GraphsCanadian Journal of Mathematics, 1952