scientific article; zbMATH DE number 4060744

MaRDI QIDQ3795247zbMATH OpenFDO

Authors Roberto Tamassia

Publication date 1988

zbMATH Keywords

dynamic data structureplanar embedding of planar graphtime complexity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• On-line Planar Graph Embedding
• Dynamic planar embeddings of dynamic graphs
• Dynamic planar embeddings of dynamic graphs
• Fast incremental planarity testing
• Data structures for two-edge connectivity in planar graphs

Cited in

(17)

• Finding paths and deleting edges in directed acyclic graphs
• Maintaining bridge-connected and biconnected components on-line
• New results on drawing angle graphs
• Algorithmic graph embeddings
• Dynamic planar embeddings of dynamic graphs
• Planarity-preserving clustering and embedding for large planar graphs
• A left-first search algorithm for planar graphs
• PLANET: a radial layout algorithm for network visualization
• Dynamic planar embeddings of dynamic graphs
• scientific article; zbMATH DE number 1500683 (Why is no real title available?)
• On-line Planar Graph Embedding
• Algorithmic graph embeddings
• Fully Dynamic Transitive Closure in plane dags with one source and one sink
• Output-sensitive reporting of disjoint paths (extended abstract)
• Linear planar 3-SAT
• Dynamic reachability in planar digraphs with one source and one sink
• Dynamic maintenance of planar digraphs, with applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3795247)