Out-degree reducing partitions of digraphs (Q1704574)
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: Out-degree reducing partitions of digraphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Out-degree reducing partitions of digraphs |
scientific article |
Statements
Out-degree reducing partitions of digraphs (English)
0 references
12 March 2018
0 references
2-partition
0 references
maximum out-degree reducing partition
0 references
NP-completeness
0 references
polynomial algorithm
0 references
0 references
0.9223198
0 references
0.8933435
0 references
0.8921659
0 references
0.8911633
0 references
0.8812891
0 references
0.8803513
0 references
0.8802115
0 references
0.8793904
0 references
