Maximum directed cuts in digraphs with degree restriction (Q3633002)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Maximum directed cuts in digraphs with degree restriction |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum directed cuts in digraphs with degree restriction |
scientific article |
Statements
Maximum directed cuts in digraphs with degree restriction (English)
0 references
16 June 2009
0 references
directed cut
0 references
maximum cut
0 references
directed cut and acyclic graphs
0 references
extremal problems
0 references
0.8460255265235901
0 references
0.8173815011978149
0 references
0.8111059069633484
0 references
0.8003522157669067
0 references
