Counting clique trees and computing perfect elimination schemes in parallel
- 1 April 1989
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 31 (2) , 61-68
- https://doi.org/10.1016/0020-0190(89)90070-7
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Tight Comparison Bounds on the Complexity of Parallel SortingSIAM Journal on Computing, 1987
- Finding a Maximum Clique in an Arbitrary GraphSIAM Journal on Computing, 1986
- Deterministic coin tossing with applications to optimal parallel list rankingInformation and Control, 1986
- Covering, Packing and Generalized PerfectionSIAM Journal on Algebraic Discrete Methods, 1985
- A Separator Theorem for Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- The intersection graphs of subtrees in trees are exactly the chordal graphsJournal of Combinatorial Theory, Series B, 1974
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961