The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233)
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 minimum feedback arc set problem and the acyclic disconnection for graphs |
scientific article; zbMATH DE number 6713452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum feedback arc set problem and the acyclic disconnection for graphs |
scientific article; zbMATH DE number 6713452 |
Statements
The minimum feedback arc set problem and the acyclic disconnection for graphs (English)
0 references
10 May 2017
0 references
feedback arc set
0 references
acyclic disconnection
0 references
oriented planar graphs
0 references
NP-completeness
0 references
0.7985875606536865
0 references
0.7899811267852783
0 references
0.775305986404419
0 references
0.7697653770446777
0 references
0.768639862537384
0 references
