Well-balanced orientations of mixed graphs

Authors:
Attila Bernáth;Gwenaël Joret
Affiliations:
Department of Operations Research, Eötvös University, Pázmány P. s. 1/C, Budapest, Hungary H-1117;Computer Science Department, Université Libre de Bruxelles, CP 212, B-1050 Brussels, Belgium
Venue:
Information Processing Letters
Year:
2008

Citing 2
Cited 0

Applications of submodular functions

Surveys in combinatorics, 1993
Efficient splitting off algorithms for graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We show that deciding if a mixed graph has a well-balanced orientation is NP-complete.