Dynamic planar embeddings of dynamic graphs
DOI10.1007/S00224-017-9768-7zbMATH Open1387.68182DBLPjournals/mst/HolmR17OpenAlexW2275934214WikidataQ61414891 ScholiaQ61414891MaRDI QIDQ1693993FDOQ1693993
Authors: Jacob Holm, Eva Rotenberg 
Publication date: 1 February 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/4931/
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- A data structure for dynamic trees
- Efficient Planarity Testing
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Maintenance of a minimum spanning forest in a dynamic plane graph
- On-Line Planarity Testing
- How to Draw a Graph
- Maintaining information in fully dynamic trees with top trees
- Title not available (Why is that?)
- Incremental convex planarity testing
- Multiple-source shortest paths in planar graphs
- Random sampling in cut, flow, and network design problems
- Fully dynamic planarity testing with applications
- Fast incremental planarity testing
- Logarithmic Lower Bounds in the Cell-Probe Model
- Separator based sparsification. I: Planarity testing and minimum spanning trees
- Alpha-algorithms for incremental planarity testing (extended abstract)
Cited In (6)
This page was built for publication: Dynamic planar embeddings of dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693993)
