Article

Algorithmica

, Volume 12, Issue 6, pp 476-497

First online:

Upward drawings of triconnected digraphs

  • P. BertolazziAffiliated withIASI-CNR
  • , G. Di BattistaAffiliated withDipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”
  • , G. LiottaAffiliated withDipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”
  • , C. ManninoAffiliated withIASI-CNR

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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+r 2) , 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

Planarity Automatic graph drkwing Hierarchical structures Max-flow st-Digraphs Acyclic digraphs Ordered sets