Egalitarian Graph Orientations

DOI10.7155/jgaa.00435zbMath1366.05106arXiv1212.2178OpenAlexW2152845747MaRDI QIDQ5278053

Lisa Zhang, Jennifer Iglesias, Antonio Ochoa, Gordon Wilfong, Glencora Borradaile, Theresa Migler

Publication date: 13 July 2017

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1212.2178

zbMATH Keywords

optimal polynomial-time algorithms

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Simultaneously load balancing for every p-norm, with reassignments ⋮ Fair integral submodular flows ⋮ Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees ⋮ Balanced Schnyder woods for planar triangulations: an experimental study with applications to graph drawing and graph separators ⋮ A Constructive Arboricity Approximation Scheme ⋮ Graph orientation with splits ⋮ Density decompositions of networks ⋮ Decreasing minimization on M-convex sets: background and structures ⋮ Decreasing minimization on M-convex sets: algorithms and applications ⋮ Graph Orientation with Edge Modifications

This page was built for publication: Egalitarian Graph Orientations