ISSN:
1436-4646
Schlagwort(e):
Combinatorial optimization
;
(0, 1) matrices
;
integrality of polyhedra
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Informatik
,
Mathematik
Notizen:
Abstract A (0, 1) matrix is linear if it does not contain a 2×2 submatrix of all ones. In this paper we give polynomial algorithms to test whether a linear matrix is balanced or perfect. The algorithms are based on decomposition results previously obtained by the authors.
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1007/BF01582135
Permalink
