Graph orientation with splits

DOI10.1007/978-3-319-96151-4_5MaRDI QIDQ5915703zbMATH OpenOpenAlexFDO

Authors Yuichi Asahiro, Jesper Jansson, Eiji Miyano, Hesam Nikpey, Hirotaka Ono

Publication date 17 August 2018

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-96151-4_5

zbMATH Keywords

algorithmcomputational complexitygraph orientationmaximum flowpartitionvertex cover

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Graph orientation with splits
• Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
• Graph orientation to maximize the minimum weighted outdegree
• GRAPH ORIENTATION ALGORITHMS TO MINIMIZE THE MAXIMUM OUTDEGREE
• Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree

Cited in

(2)

• Graph orientation with edge modifications
• Graph orientation with splits

This page was built for publication: Graph orientation with splits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5915703)