Directing Road Networks by Listing Strong Orientations

  • Alessio Conte
  • Roberto Grossi
  • Andrea Marino
  • Romeo Rizzi
  • Luca Versari
Conference paper

DOI: 10.1007/978-3-319-44543-4_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9843)
Cite this paper as:
Conte A., Grossi R., Marino A., Rizzi R., Versari L. (2016) Directing Road Networks by Listing Strong Orientations. In: Mäkinen V., Puglisi S., Salmela L. (eds) Combinatorial Algorithms. IWOCA 2016. Lecture Notes in Computer Science, vol 9843. Springer, Cham

Abstract

A connected road network with N nodes and L edges has \(K \le L\) edges identified as one-way roads. In a feasible direction, these one-way roads are assigned a direction each, so that every node can reach any other [Robbins ’39]. Using O(L) preprocessing time and space usage, it is shown that all feasible directions can be found in O(K) amortized time each. To do so, we give a new algorithm that lists all the strong orientations of an undirected connected graph with m edges in O(m) amortized time each, using O(m) space. The cost can be deamortized to obtain O(m) delay with \(O(m^2)\) preprocessing time and space.

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  • Alessio Conte
    • 1
  • Roberto Grossi
    • 1
  • Andrea Marino
    • 1
  • Romeo Rizzi
    • 2
  • Luca Versari
    • 3
  1. 1.Università di PisaPisaItaly
  2. 2.Università di VeronaVeronaItaly
  3. 3.Scuola Normale SuperiorePisaItaly

Personalised recommendations