Level Planar Embedding in Linear Time
DOI10.7155/JGAA.00045zbMATH Open1001.05048OpenAlexW2089449364MaRDI QIDQ4540530FDOQ4540530
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1377359
- Planar embedding: linear-time algorithms for vertex placement and edge orderings
- Radial Level Planarity Testing and Embedding in Linear Time
- Embedding into the rectilinear plane in optimal \(O(n^{2})\) time
- Graph Drawing
- Projective Planarity in Linear Time
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Fast and compact planar embeddings
- Fast and compact planar embeddings
- Embedding rectilinear graphs in linear time
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (29)
- Simultaneous graph embedding with bends and circular arcs
- Cyclic Level Planarity Testing and Embedding
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matched drawability of graph pairs and of graph triples
- Beyond level planarity
- Multilevel planarity
- Multilevel planarity
- Hanani-Tutte for Radial Planarity II
- Radial level planarity with fixed embedding
- Algorithms for multi-level graph planarity testing and layout
- Computing upward topological book embeddings of upward planar digraphs
- Straight-Line Drawability of a Planar Graph Plus an Edge
- Title not available (Why is that?)
- Characterization of Unlabeled Level Planar Graphs
- Data Structures and their Planar Graph Layouts
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Characterization of unlabeled level planar trees
- Practical Level Planarity Testing and Layout with Embedding Constraints
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Embeddability Problems for Upward Planar Digraphs
- A satisfiability formulation of problems on level graphs
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Strip planarity testing
- Title not available (Why is that?)
- Level-planarity: transitivity vs. even crossings
- Strip planarity testing for embedded planar graphs
- Upward planar drawings on the standing and the rolling cylinders
This page was built for publication: Level Planar Embedding in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4540530)
