Uncovering generalized-network structure in matrices (Q1308737)

A generalized-network matrix is a matrix that has at most two nonzeros per column. The generalized-network recognition problem for an arbitrary matrix \(A\) is the problem of determining a nonsingular matrix \(T\), if one exists, such that \(TA\) is a generalized-network matrix. This paper presents a polynomial-time algorithm that under an assumption on the combinatorial structure of \(A\) solves the generalized-network recognition problem. The bicircular matroids play an important role in this paper.