Minimizing maximum indegree

  title={Minimizing maximum indegree},
  author={Venkat Venkateswaran},
  journal={Discrete Applied Mathematics},
We study the problem of orienting the edges of a given simple graph so that the maximum indegree of nodes is minimized. We also develop an algorithm to produce such an extremal orientation on any given simple graph. c © 2003 Elsevier B.V. All rights reserved. MSC: 05C35 

From This Paper

Topics from this paper.


Publications citing this paper.
Showing 1-10 of 22 extracted citations

Egalitarian Graph Orientations

J. Graph Algorithms Appl. • 2017
View 3 Excerpts
Highly Influenced

Gap-planar graphs

Theor. Comput. Sci. • 2018
View 1 Excerpt

Gap-Planar Graphs

Graph Drawing • 2017
View 1 Excerpt

Distributed Black Virus Decontamination and Rooted Acyclic Orientations

2015 IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing • 2015


Publications referenced by this paper.
Showing 1-4 of 4 references

Theory of linear and integer programming

Wiley-Interscience series in discrete mathematics and optimization • 1999
View 1 Excerpt

Integer and combinatorial optimization

Wiley interscience series in discrete mathematics and optimization • 1988
View 2 Excerpts

An extension of a theorem of Dantzig’s

I. Heller, C. B. Tompkins
in: H.W. Kuhn, A.W. Tucker (Eds.), Linear Inequalities and Related Systems, Princeton University Press, Princeton, NJ • 1956
View 1 Excerpt

Similar Papers

Loading similar papers…