Theory of linear and integer programming
Theory of linear and integer programming
Integer and combinatorial optimization
Integer and combinatorial optimization
Graph Theory With Applications
Graph Theory With Applications
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
Approximation Algorithms for the Graph Orientation Minimizing the Maximum Weighted Outdegree
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Edges and switches, tunnels and bridges
Computational Geometry: Theory and Applications
Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
Discrete Applied Mathematics
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
The edge-orientation problem and some of its variants on weighted graphs
Information Sciences: an International Journal
Edges and switches, tunnels and bridges
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Upper and lower degree bounded graph orientation with minimum penalty
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
The complexity of the proper orientation number
Information Processing Letters
| Hi-index | 0.05 |
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.