Algorithms for plane representations of acyclic digraphs
type: Item
instance of: scholarly article
title: Algorithms for plane representations of acyclic digraphs
zbMATH Open document ID: 0678.68059
DOI: 10.1016/0304-3975(88)90123-5
author: Giuseppe Di Battista
author: Roberto Tamassia
published in: Theoretical Computer Science
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 4112032
zbMATH Keywords: planar graph
zbMATH Keywords: drawing
zbMATH Keywords: embedding
zbMATH Keywords: Acyclic digraphs
zbMATH Keywords: st-graphs
Wikidata QID: Q56227817
MaRDI profile type: Publication
full work available at URL: 0304-3975(88)90123-5
OpenAlex ID: W2002906478
cites work: Q5331549
cites work: Q3220608
cites work: A linear algorithm for embedding planar graphs using PQ-trees
cites work: Drawing plane graphs nicely
cites work: Q3785966
cites work: Q3731621
cites work: Computing an st-numbering
cites work: Q3883524
cites work: Q5786239
cites work: Q3912814
cites work: Planar Lattices
cites work: On the dimension of partially ordered sets
cites work: Fundamentals of planar ordered sets
cites work: Planar lattices and planar graphs
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: Convex Maps
cites work: On minimal-node-cost planar embeddings
cites work: A unified approach to visibility representations of planar graphs
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
cites work: Planarity and duality of finite and infinite graphs
cites work: Q3216670
cites work: The dimension of planar posets
cites work: Convex Representations of Graphs
cites work: How to Draw a Graph
cites work: Bemerkungen zum Vierfarbenproblem
cites work: Crossing Theory and Hierarchy Mapping
cites work: An algorithm for straight-line representation of simple planar graphs
cites work: Q3278735
description: scientific article; zbMATH DE number 4112032