A good submatrix is hard to find
- 1 November 1982
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 1 (5) , 190-193
- https://doi.org/10.1016/0167-6377(82)90038-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Node-Deletion Problems on Bipartite GraphsSIAM Journal on Computing, 1981
- Converting Linear Programs to Network ProblemsMathematics of Operations Research, 1980
- Decomposition of regular matroidsJournal of Combinatorial Theory, Series B, 1980
- The node-deletion problem for hereditary properties is NP-completeJournal of Computer and System Sciences, 1980
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965