Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51
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
Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree
Journal of Combinatorial Optimization
Series-parallel orientations preserving the cycle-radius
Information Processing Letters
The complexity of two graph orientation problems
Discrete Applied Mathematics
Graph orientation algorithms to minimize the maximum outdegree
CATS '06 Proceedings of the Twelfth Computing: The Australasian Theory Symposium - Volume 51
| Hi-index | 0.00 |
The oriented diameter of a bridgeless connected undirected(bcu) graph G is the smallest diameter among all thediameters of strongly connected orientations of G. We studyalgorithmic aspects of determining the oriented diameter of achordal graph. We (a) construct a linear-time approximationalgorithm that, for a given chordal bcu graph G,finds a strongly connected orientation of G with diameter atmost one plus twice the oriented diameter of G; (b) provethat, for every k≥ 2 and k ≠ 3, to decidewhether a chordal (split for k = 2) bcu graphG admits an orientation of diameter k isNP-complete; (c) show that, unless P = NP,there is neither a polynomial-time absolute approximation algorithmnor an ±-approximation algorithm that computes the orienteddiameter of a bcu chordal graph for ±