Doubly Lexical Orderings of Matrices
- 1 October 1987
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 16 (5) , 854-879
- https://doi.org/10.1137/0216057
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Packing and covering a tree by subtreesCombinatorica, 1986
- The k-Domination and k-Stability Problems on Sun-Free Chordal GraphsSIAM Journal on Algebraic Discrete Methods, 1984
- Characterizations of totally balanced matricesJournal of Algorithms, 1984
- Domination, independent domination, and duality in strongly chordal graphsDiscrete Applied Mathematics, 1984
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Degrees of acyclicity for hypergraphs and relational database schemesJournal of the ACM, 1983
- Characterizations of strongly chordal graphsDiscrete Mathematics, 1983
- Properties of (0, 1)-matrices without certain configurationsJournal of Combinatorial Theory, Series A, 1981
- A characterisation of rigid circuit graphsDiscrete Mathematics, 1974
- On rigid circuit graphsAbhandlungen aus dem Mathematischen Seminar der Universitat Hamburg, 1961