SOFSEM 2004: Theory and Practice of Computer Science
From MaRDI portal
Publication:5902007
Recommendations
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
- Permuting matrices to avoid forbidden submatrices
- Matrices with forbidden submatrices
- On forbidden submatrices
- On linear forbidden submatrices
- A general approach to avoiding two by two submatrices
- scientific article; zbMATH DE number 1463403
- Forbidden submatrices
- Forbidden submatrices: some new bounds and constructions
- Matrices with forbidden subconfigurations
Cited in
(6)- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS
- Permuting matrices to avoid forbidden submatrices
- Perfect phylogenies via branchings in acyclic digraphs and a generalization of Dilworth's theorem
- Parameterized Complexity for Finding a Perfect Phylogeny from Mixed Tumor Samples
- Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays
This page was built for publication: SOFSEM 2004: Theory and Practice of Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5902007)