On finding orientations with the fewest number of vertices with small out-degree (Q494438)
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: On finding orientations with the fewest number of vertices with small out-degree |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding orientations with the fewest number of vertices with small out-degree |
scientific article |
Statements
On finding orientations with the fewest number of vertices with small out-degree (English)
0 references
1 September 2015
0 references
graph orientation
0 references
graph algorithms
0 references
0.9049283
0 references
0.9026747
0 references
0.8851731
0 references
0.87621546
0 references
0.87621546
0 references
0.87303686
0 references
0.86563003
0 references
0.8635049
0 references
