A note on the parameterized complexity of unordered maximum tree orientation (Q427909)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6047066
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the parameterized complexity of unordered maximum tree orientation |
scientific article; zbMATH DE number 6047066 |
Statements
A note on the parameterized complexity of unordered maximum tree orientation (English)
0 references
18 June 2012
0 references
graph orientation
0 references
directed path
0 references
parameterized reduction
0 references
bipartization
0 references
0 references
0 references
0.7107828259468079
0 references
0.709367573261261
0 references
0.7070122361183167
0 references
0.7062734365463257
0 references
0.6957737803459167
0 references
