scientific article

zbMath0765.68024MaRDI QIDQ4038721

Roberto Tamassia, Giuseppe Di Battista

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

SPQR-treeon-line graph problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items

Dynamic 2- and 3-connectivity on planar graphs ⋮ A linear algorithm for the maximal planar subgraph problem ⋮ Upward planarity testing ⋮ 3-connected reduction for regular graph covers ⋮ Decremental 2- and 3-connectivity on planar graphs ⋮ Planar Embeddings with Small and Uniform Faces ⋮ Jordan-like characterization of automorphism groups of planar graphs ⋮ The Rique-number of graphs ⋮ Output-sensitive reporting of disjoint paths (extended abstract) ⋮ On-line convex planarity testing ⋮ Average case analysis of fully dynamic connectivity for directed graphs ⋮ An SPQR-tree-like embedding representation for upward planarity ⋮ Unnamed Item ⋮ Planar L-Drawings of Directed Graphs ⋮ A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing ⋮ Maintaining bridge-connected and biconnected components on-line ⋮ Dynamic algorithms for shortest paths in planar graphs ⋮ Dynamic reachability in planar digraphs with one source and one sink ⋮ Fast incremental planarity testing ⋮ Maintenance of triconnected components of graphs ⋮ Graph isomorphism restricted by lists ⋮ Computing k-modal embeddings of planar digraphs ⋮ Approximation Algorithms for Facial Cycles in Planar Embeddings ⋮ Connectivity of workflow nets: The foundations of stepwise verification ⋮ Average case analysis of fully dynamic reachability for directed graphs ⋮ On counting planar embeddings