Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2016.05.034 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2283724883 / rank | |||
Normal rank | |||
Revision as of 19:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding good 2-partitions of digraphs. II. Enumerable properties |
scientific article |
Statements
Finding good 2-partitions of digraphs. II. Enumerable properties (English)
0 references
5 July 2016
0 references
oriented
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
