Level Planar Embedding in Linear Time
From MaRDI portal
Publication:4540530
DOI10.7155/jgaa.00045zbMath1001.05048OpenAlexW2089449364MaRDI QIDQ4540530
Michael Jünger, Sebastian Leipert
Publication date: 25 July 2002
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/49579
Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
Straight-Line Drawability of a Planar Graph Plus an Edge ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Hanani-Tutte for Radial Planarity II ⋮ Unnamed Item ⋮ Characterization of unlabeled level planar trees ⋮ Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs ⋮ Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Data Structures and their Planar Graph Layouts ⋮ Simultaneous graph embedding with bends and circular arcs ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Matched drawability of graph pairs and of graph triples ⋮ Embeddability Problems for Upward Planar Digraphs ⋮ Cyclic Level Planarity Testing and Embedding ⋮ Practical Level Planarity Testing and Layout with Embedding Constraints ⋮ Multilevel Planarity ⋮ Level-planarity: transitivity vs. even crossings
This page was built for publication: Level Planar Embedding in Linear Time
