Minmax relations for cyclically ordered digraphs (Q885290)
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 5162675
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minmax relations for cyclically ordered digraphs |
scientific article; zbMATH DE number 5162675 |
Statements
Minmax relations for cyclically ordered digraphs (English)
0 references
8 June 2007
0 references
stable set
0 references
coloring
0 references
orders
0 references
covering
0 references
packing
0 references
polyhedron
0 references
network flow
0 references
minimum cost flow
0 references
0.8518015742301941
0 references
0.7906554341316223
0 references
0.773581326007843
0 references
0.773581326007843
0 references
