Planar bus graphs
From MaRDI portal
Publication:724233
DOI10.1007/s00453-017-0321-5zbMath1392.68321OpenAlexW2614178260MaRDI QIDQ724233
Stefan Felsner, Till Bruckdorfer, Michael Kaufmann
Publication date: 25 July 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-017-0321-5
Analysis of algorithms (68W40) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- On grid intersection graphs
- The Steiner tree problem
- A left-first search algorithm for planar graphs
- On-line maintenance of triconnected components with SPQR-trees
- Maximum matchings in planar graphs via Gaussian elimination
- Efficient Algorithms for Petersen's Matching Theorem
- Rectangle and Square Representations of Planar Graphs
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Improved Circular Layouts
- On Finding the Rectangular Duals of Planar Triangular Graphs
- Planar Lombardi Drawings for Subcubic Graphs
- On Steiner’s Problem with Rectilinear Distance
- On the Core of a Graph†
- Graph-Theoretic Concepts in Computer Science
- On topological aspects of orientations
- Drawing graphs. Methods and models