Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177)
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: Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree |
scientific article; zbMATH DE number 5880187
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree |
scientific article; zbMATH DE number 5880187 |
Statements
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (English)
0 references
19 April 2011
0 references
graph orientation
0 references
min-max optimization
0 references
\(\mathcal {NP}\)-hardness
0 references
cactus
0 references
(outer)planar
0 references
\((P_{4}-)\)bipartite
0 references
series-parallel
0 references
0 references
0.9409857
0 references
0.9409855
0 references
0.9178171
0 references
0.9142298
0 references
0.90744424
0 references
0.90744424
0 references
0.9035157
0 references
0.89636487
0 references
0.88395816
0 references
0.8829302
0 references
