Graph Orientation with Splits

The Minimum Maximum Outdegree Problem (MMO) is to assign a direction to every edge in an input undirected, edge-weighted graph so that the maximum weighted outdegree taken over all vertices becomes as small as possible. In this paper, we introduce a new variant of MMO called the p-Split Minimum Maximum Outdegree Problem (p-Split-MMO) in which one is allowed to perform a sequence of p split operations on the vertices before orienting the edges, for some specified non-negative integer p, and study its computational complexity.

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  Glencora Borradaile,et al.  Egalitarian Graph Orientations , 2012, J. Graph Algorithms Appl..

[3]  Gerth Stølting Brodal,et al.  Dynamic Representation of Sparse Graphs , 1999, WADS.

[4]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[5]  Yuichi Asahiro,et al.  Graph Orientations Optimizing the Number of Light or Heavy Vertices , 2012, J. Graph Algorithms Appl..

[6]  James B. Orlin,et al.  Max flows in O(nm) time, or better , 2013, STOC '13.

[7]  Yuichi Asahiro,et al.  Degree-Constrained Graph Orientation: Maximum Satisfaction and Minimum Violation , 2014, Theory of Computing Systems.

[8]  Yuichi Asahiro,et al.  Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree , 2011, J. Comb. Optim..

[9]  Yuichi Asahiro,et al.  Graph orientation to maximize the minimum weighted outdegree , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[10]  Toshihiro Fujito,et al.  A unified approximation algorithm problems ” , 1998 .

[11]  R. W. Deming.  Acyclic orientations of a graph and chromatic and independence numbers , 1979, J. Comb. Theory, Ser. B.

[12]  Venkat Venkateswaran,et al.  Minimizing maximum indegree , 2004, Discret. Appl. Math..

[13]  Marek Chrobak,et al.  Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices , 1991, Theor. Comput. Sci..

[14]  Kaveh Khoshkhah,et al.  On finding orientations with the fewest number of vertices with small out-degree , 2015, Discret. Appl. Math..

[15]  David Zuckerman.  Linear Degree Extractors and the Inapproximability of Max Clique and Chromatic Number , 2007, Theory Comput..