Construction Techniques for Digraphs with Minimum Diameter

  • Mirka Miller
  • Slamin
  • Joe Ryan
  • Edy Tri Baskoro
Conference paper

DOI: 10.1007/978-3-642-45278-9_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8288)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Mirka Miller
    • 1
    • 2
    • 3
    • 4
  • Slamin
    • 5
  • Joe Ryan
    • 6
  • Edy Tri Baskoro
    • 4
    • 6
  1. 1.School of Mathematical and Physical SciencesUniversity of NewcastleAustralia
  2. 2.Department of MathematicsUniversity of West BohemiaPilsenCzech Republic
  3. 3.Department of InformaticsKing’s College LondonUnited Kingdom
  4. 4.Department of MathematicsITB BandungIndonesia
  5. 5.School of Information SystemsUniversity of JemberIndonesia
  6. 6.School of Electrical Engineering and Computer ScienceUniversity of NewcastleAustralia

Personalised recommendations