Data Structures and their Planar Graph Layouts
From MaRDI portal
Recommendations
- Data structures for two-edge connectivity in planar graphs
- scientific article; zbMATH DE number 2080103
- Planar graphs: Theory and algorithms
- PLANAR GRAPHS AND RELATED TOPICS
- Graphs and graph algorithms
- scientific article; zbMATH DE number 777378
- Graphs and algorithms
- Graphs and algorithms
- scientific article; zbMATH DE number 475620
Cites work
- A characterization of level planar graphs
- Characterizations of deque and queue graphs
- Characterizing planarity by the splittable deque
- Classification of planar upward embedding
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Crossing minimization in extended level drawings of graphs
- Digraph embedding
- Efficient Planarity Testing
- Embedding planar graphs in four pages
- Graph algorithms. Edited by Guy Even. With a foreword by Richard M. Karp
- Graph Drawing
- Graph Drawing
- Hierarchies and planarity theory
- How to Draw a Graph
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 4049084 (Why is no real title available?)
- scientific article; zbMATH DE number 3499787 (Why is no real title available?)
- scientific article; zbMATH DE number 1954397 (Why is no real title available?)
- scientific article; zbMATH DE number 1796967 (Why is no real title available?)
- scientific article; zbMATH DE number 2159644 (Why is no real title available?)
- scientific article; zbMATH DE number 3895002 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Laying Out Graphs Using Queues
- Level Planar Embedding in Linear Time
- On the Queue Number of Planar Graphs
- Plane Drawings of Queue and Deque Graphs
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Stacks, queues and tracks: layouts of graph subdivisions
- The book thickness of a graph
- Trémaux trees and planarity
- Upward planar drawings on the standing and the rolling cylinders
Cited in
(9)- Data structures for topological and geometric operations on networks
- Deque automata, languages, and planar graph representations
- Fan-crossing free graphs and their relationship to other beyond-planar graphs
- Characterizing planarity by the splittable deque
- Characterizations of deque and queue graphs
- The Rique-number of graphs
- Möbius book embeddings
- Deques on a torus
- Klein book embeddings
This page was built for publication: Data Structures and their Planar Graph Layouts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637665)