Radial Level Planarity Testing and Embedding in Linear Time
DOI10.7155/JGAA.00100zbMATH Open1085.05025OpenAlexW2167892345MaRDI QIDQ3378508FDOQ3378508
Authors: Christian Bachmaier, Michael Forster, Franz J. Brandenburg 
Publication date: 3 April 2006
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/52246
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (23)
- Radial drawings of graphs: geometric constraints and trade-offs
- Simultaneous graph embedding with bends and circular arcs
- Cyclic Level Planarity Testing and Embedding
- Computing k-modal embeddings of planar digraphs
- Level planarity: transitivity vs. even crossings
- Crossing minimization in extended level drawings of graphs
- Title not available (Why is that?)
- Mixed linear layouts of planar graphs
- Beyond level planarity
- Small point sets for simply-nested planar graphs
- Multilevel planarity
- Hanani-Tutte for Radial Planarity II
- Radial level planarity with fixed embedding
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs
- Computing and Combinatorics
- Hanani-Tutte for radial planarity. II
- Graph Drawing
- Level Planar Embedding in Linear Time
- Simultaneous Embedding
- Level-planarity: transitivity vs. even crossings
- Strip planarity testing for embedded planar graphs
- Upward planar drawings on the standing and the rolling cylinders
Uses Software
This page was built for publication: Radial Level Planarity Testing and Embedding in Linear Time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3378508)
