Loading...

Graph orientation with splits

Asahiro, Y ; Sharif University of Technology | 2018

804 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/978-3-319-96151-4_5
  3. Publisher: Springer Verlag , 2018
  4. Abstract:
  5. 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. © 2018, Springer International Publishing AG, part of Springer Nature
  6. Keywords:
  7. Algorithm ; Graph orientation ; Maximum flow ; Partition ; Algorithms ; Combinatorial optimization ; Computational complexity ; Flow graphs ; Partitions (building) ; Edge-weighted graph ; Graph orientations ; Maximum flows ; Nonnegative integers ; Outdegree ; Split operations ; Vertex cover ; Graph theory
  8. Source: 5th International Symposium on Combinatorial Optimization, ISCO 2018, 11 April 2018 through 13 April 2018 ; Volume 10856 LNCS , 2018 , Pages 52-63 ; 03029743 (ISSN); 9783319961507 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007%2F978-3-319-96151-4_5