A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix |
scientific article |
Statements
A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (English)
0 references
23 October 2012
0 references
graph algorithms
0 references
consecutive ones property
0 references
Tucker patterns
0 references
certifying algorithm
0 references
incompatibility graph
0 references
0 references
