The complexity of deciding whether a graph admits an orientation with fixed weak diameter (Q2808534)
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: The complexity of deciding whether a graph admits an orientation with fixed weak diameter |
scientific article; zbMATH DE number 6584108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of deciding whether a graph admits an orientation with fixed weak diameter |
scientific article; zbMATH DE number 6584108 |
Statements
24 May 2016
0 references
oriented graph
0 references
weak diameter
0 references
strong diameter
0 references
complexity
0 references
0.90004706
0 references
0 references
0 references
0.88700914
0 references
0 references
0.8843986
0 references
0.88240325
0 references
The complexity of deciding whether a graph admits an orientation with fixed weak diameter (English)
0 references
