Construction Techniques for Digraphs with Minimum Diameter
- Cite this paper as:
- Miller M., Slamin, Ryan J., Baskoro E.T. (2013) Construction Techniques for Digraphs with Minimum Diameter. In: Lecroq T., Mouchard L. (eds) Combinatorial Algorithms. IWOCA 2013. Lecture Notes in Computer Science, vol 8288. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.