Minimum cycle factors in quasi-transitive digraphs (Q924641)
From MaRDI portal
!
WARNING
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 5276157
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum cycle factors in quasi-transitive digraphs |
scientific article; zbMATH DE number 5276157 |
Statements
Minimum cycle factors in quasi-transitive digraphs (English)
0 references
16 May 2008
0 references
complementary cycles
0 references
cycle factor
0 references
quasi-transitive digraph
0 references
network flow
0 references
polynomial algorithm
0 references
irreducible cycle factor
0 references
0 references
0 references
0 references
0 references
0.8932043313980103
0 references
0.8151460886001587
0 references
0.8049424886703491
0 references
0.8022754788398743
0 references
