We consider the so-called order/degree problem, that is, to determine the smallest diameter of a digraph given order and maximum out-degree. There is no general efficient algorithm known for the construction of such optimal digraphs but various construction techniques for digraphs with minimum diameter have been proposed. In this paper, we survey the known techniques. © 2013 Springer-Verlag.
CITATION STYLE
Miller, M., Slamin, Ryan, J., & Baskoro, E. T. (2013). Construction techniques for digraphs with minimum diameter. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8288 LNCS, pp. 327–336). https://doi.org/10.1007/978-3-642-45278-9_28
Mendeley helps you to discover research relevant for your work.