Uncovering generalized-network structure in matrices (Q1308737)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 464951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Uncovering generalized-network structure in matrices |
scientific article; zbMATH DE number 464951 |
Statements
Uncovering generalized-network structure in matrices (English)
0 references
10 December 1993
0 references
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.
0 references
generalized-network matrix
0 references
polynomial-time algorithm
0 references
generalized- network recognition problem
0 references
bicircular matroids
0 references
0.8296632170677185
0 references
0.8278595209121704
0 references
0.7988256812095642
0 references
0.795254111289978
0 references
