Finding good 2-partitions of digraphs II. Enumerable properties
Under an Elsevier user license
open archive
Keywords
Oriented
NP-complete
Polynomial
Partition
Splitting digraphs
Acyclic
Semicomplete digraph
Tournament
Out-branching
Feedback vertex set
2-Partition
Minimum degree
Cited by (0)
- 1
This work was done while the first author was visiting INRIA, Sophia Antipolis, France, project COATI. Hospitality and financial support from Labex UCN@Sophia, Sophia Antipolis is gratefully acknowledged. The research of Bang-Jensen was also supported by the Danish research council under grant number 1323-00178B.
- 2
Partially supported by ANR under contract STINT ANR-13-BS02-0007.
© 2016 Elsevier B.V.