Algorithmica

, Volume 12, Issue 6, pp 476–497

Upward drawings of triconnected digraphs

Authors

  • P. Bertolazzi
    • IASI-CNR
  • G. Di Battista
    • Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”
  • G. Liotta
    • Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”
  • C. Mannino
    • IASI-CNR
Article

DOI: 10.1007/BF01188716

Cite this article as:
Bertolazzi, P., Battista, G.D., Liotta, G. et al. Algorithmica (1994) 12: 476. doi:10.1007/BF01188716

Abstract

A polynomial-time algorithm for testing if a triconnected directed graph has an upward drkwing is presented. An upward drkwing is a planar drkwing such that all the edges flow in a common direction (e.g., from bottom to top). The problem arises in the fields of automatic graph drkwing and ordered sets, and has been open for several years. The proposed algorithm is based on a new combinatorial characterization that maps the problem into a max-flow problem on a sparse network; the time complexity isO(n+r2), wheren is the number of vertices andr is the number of sources and sinks of the directed graph. If the directed graph has an upward drkwing, the algorithm allows us to construct one easily.

Key words

PlanarityAutomatic graph drkwingHierarchical structuresMax-flowst-DigraphsAcyclic digraphsOrdered sets
Download to read the full article text

Copyright information

© Springer-Verlag New York Inc 1994