On the optimal strongly connected orientations of city street graphs I: large grids
SIAM Journal on Discrete Mathematics
Methods and problems of communication in usual networks
Proceedings of the international workshop on Broadcasting and gossiping 1990
Graph classes: a survey
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Digraphs: Theory, Algorithms and Applications
Digraphs: Theory, Algorithms and Applications
Algorithms for graphs with small octopus
Discrete Applied Mathematics
| Hi-index | 0.00 |
The oriented diameter of a (undirected) graph G is the smallest diameter among all the diameters of strongly connected orientations of G. We study algorithmic aspects of determining the oriented diameter of a chordal graph. We - give a linear time algorithm such that, for a given chordal graph G, either concludes that there is no strongly connected orientation of G, or finds a strongly connected orientation of G with diameter at most twice the diameter of G plus one; - prove that the corresponding decision problem remains NP-complete even when restricted to a small subclass of chordal graphs called split graphs; - show that unless P = NP, there is neither a polynomial-time absolute approximation algorithm nor an a-approximation (for every 驴