A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix (Q456131)
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 6098090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tight bound on the length of odd cycles in the incompatibility graph of a non-C1P matrix |
scientific article; zbMATH DE number 6098090 |
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
0.7414329051971436
0 references
0.7273521423339844
0 references
0.7236617207527161
0 references
