Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baskoro, E.T., Branković, L., Miller, M., Plesník, J., Ryan, J., Siráň, J.: Large digraphs with small diameter: A voltage assignment approach. JCMCC 24, 161–176 (1997)
Bridges, W.G., Toueg, S.: On the impossibility of directed Moore graphs. J. Combinatorial Theory Series B29, 339–341 (1980)
Fiol, M.A., Llado, A.S.: The partial line digraph technique in the design of large interconnection networks. IEEE Trans. on Computers 41(7), 848–857 (1992)
Fiol, M.A., Llado, A.S., Villar, J.L.: Digraphs on alphabets and the (d,N) digraph problem. Ars Combinatoria 25C, 105–122 (1988)
Fiol, M.A., Yebra, J.L.A., Alegre, I.: Line digraph iterations and the (d,k) digraph problem. IEEE Transactions on Computers C-33, 400–403 (1984)
Imase, M., Itoh, M.: Design to minimize a diameter on building block network. IEEE Trans. on Computers C-30, 439–442 (1981)
Imase, M., Itoh, M.: A design for directed graphs with minimum diameter. IEEE Trans. on Computers C-32, 782–784 (1983)
Miller, M., Fris, I.: Minimum diameter of diregular digraphs of degree 2. Computer Journal 31, 71–75 (1988)
Miller, M.: On the monotonicity of minimum diameter with respect to order and maximum out-degree. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 193–201. Springer, Heidelberg (2000)
Plesník, J., Znám, Š.: Strongly geodetic directed graphs. In: Acta F. R. N. Univ. Comen. - Mathematica XXIX, pp. 29–34 (1974)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-45278-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-45278-9_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45277-2
Online ISBN: 978-3-642-45278-9
eBook Packages: Computer ScienceComputer Science (R0)