A polynomial recognition algorithm for balanced matrices

被引：11
|
作者：
Zambelli, G [1 ]
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2005年 / 95卷 / 01期
关键词：
balanced matrices; recognition algorithm; signed bipartite graphs;
D O I：
10.1016/j.jctb.2005.02.006
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A 0, +/- 1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti et al. (J. Combin. Theory B 77 (1999) 292; B 81 (2001) 275), provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduced by Chudnovsky and Seymour (Combinatorica, to appear) for Berge graphs. (C) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码：49 / 67
页数：19
相关论文
共 50 条
12345