Planar bus graphs
From MaRDI portal
Publication:724233
DOI10.1007/S00453-017-0321-5zbMATH Open1392.68321OpenAlexW2614178260MaRDI QIDQ724233FDOQ724233
Authors: Till Bruckdorfer, Stefan Felsner, 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
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)
Cites Work
- The Steiner tree problem
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
- Improved Circular Layouts
- On Finding the Rectangular Duals of Planar Triangular Graphs
- A unified approach to visibility representations of planar graphs
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Drawing graphs. Methods and models
- Efficient algorithms for Petersen's matching theorem
- Rectangle and Square Representations of Planar Graphs
- Title not available (Why is that?)
- On grid intersection graphs
- On topological aspects of orientations
- A left-first search algorithm for planar graphs
- On-line maintenance of triconnected components with SPQR-trees
- Binary labelings for plane quadrangulations and their relatives
- Maximum matchings in planar graphs via Gaussian elimination
- On Steiner’s Problem with Rectilinear Distance
- Title not available (Why is that?)
- Title not available (Why is that?)
- Planar Lombardi Drawings for Subcubic Graphs
- On the Core of a Graph†
- Subgraph induced planar connectivity augmentation (extended abstract)
Cited In (2)
This page was built for publication: Planar bus graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q724233)
