Maximum directed cuts in acyclic digraphs (Q3445498)
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 5163523
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum directed cuts in acyclic digraphs |
scientific article; zbMATH DE number 5163523 |
Statements
Maximum directed cuts in acyclic digraphs (English)
0 references
11 June 2007
0 references
directed cut
0 references
maximum cut
0 references
directed and acyclic graphs
0 references
extremal problems
0 references
0.8462846875190735
0 references
0.8460255265235901
0 references
0.8297621011734009
0 references
0.8101948499679565
0 references
