Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530)
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: Finding good 2-partitions of digraphs. I. Hereditary properties |
scientific article; zbMATH DE number 6588481
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding good 2-partitions of digraphs. I. Hereditary properties |
scientific article; zbMATH DE number 6588481 |
Statements
Finding good 2-partitions of digraphs. I. Hereditary properties (English)
0 references
1 June 2016
0 references
NP-completeness
0 references
polynomial
0 references
partition
0 references
splitting digraphs
0 references
acyclic
0 references
semicomplete digraph
0 references
tournament
0 references
out-branching
0 references
feedback vertex set
0 references
2-partition
0 references
minimum degree
0 references
0 references
0.9730178117752076
0 references
0.8981390595436096
0 references
0.8899587392807007
0 references
0.8678203225135803
0 references
0.83378005027771
0 references
