Probe matrix problems: Totally balanced matrices

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Let M be a class of 0/1-matrices. A 0/l/*-matrix A where the *s induce a submatrix is a probe matrix of M if the *s in A can be replaced by Os and Is such that A becomes a member of M. We show that for M being the class of totally balanced matrices, it can be decided in polynomial time whether A is a probe totally balanced matrix. On our route toward proving this main result, we also prove that so-called partitioned probe strongly chordal graphs and partitioned probe chordal bipartite graphs can be recognized in polynomial time. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Chandler, D. B., Guo, J., Kloks, T., & Niedermeier, R. (2007). Probe matrix problems: Totally balanced matrices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4508 LNCS, pp. 368–377). Springer Verlag. https://doi.org/10.1007/978-3-540-72870-2_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free