Dynamic planar embeddings of dynamic graphs
type: Item
instance of: scholarly article
title: Dynamic planar embeddings of dynamic graphs
zbMATH Open document ID: 1387.68182
author: Jacob Holm
author: Eva Rotenberg
published in: Theory of Computing Systems
publication date: 2018-02-01T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/4931/
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6833240
zbMATH Keywords: data structures
zbMATH Keywords: planar graphs
zbMATH Keywords: graph algorithms
zbMATH Keywords: graph embeddings
zbMATH Keywords: dynamic data structures
zbMATH Keywords: graph theory
MaRDI profile type: Publication
OpenAlex ID: W2275934214
Wikidata QID: Q61414891
cites work: Maintaining information in fully dynamic trees with top trees
cites work: Incremental convex planarity testing
cites work: On-Line Planarity Testing
cites work: Q4471349
cites work: Separator based sparsification. I: Planarity testing and minimum spanning trees
cites work: Maintenance of a minimum spanning forest in a dynamic plane graph
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Fully dynamic planarity testing with applications
cites work: Efficient Planarity Testing
cites work: Random sampling in cut, flow, and network design problems
cites work: Multiple-source shortest paths in planar graphs
cites work: Alpha-algorithms for incremental planarity testing (extended abstract)
cites work: Logarithmic Lower Bounds in the Cell-Probe Model
cites work: A data structure for dynamic trees
cites work: How to Draw a Graph
cites work: Q3216652
cites work: Fast incremental planarity testing
DBLP publication ID: journals/mst/HolmR17
DOI: 10.1007/S00224-017-9768-7
description: scientific article; zbMATH DE number 6833240