scientific article
From MaRDI portal
Publication:3138871
zbMath0800.68627MaRDI QIDQ3138871
David Eppstein, Giuseppe F. Italiano, Roberto Tamassia, Robert Endre Tarjan, Jeffery Westbrook, Mordechai M. Yung
Publication date: 2 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items (14)
Data structures for two-edge connectivity in planar graphs ⋮ Fully dynamic biconnectivity in graphs ⋮ Finding the k smallest spanning trees ⋮ Fully dynamic 2-edge-connectivity in planar graphs ⋮ Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm ⋮ Average case analysis of dynamic geometric optimization ⋮ Reachability preserving compression for dynamic graph ⋮ Average case analysis of fully dynamic connectivity for directed graphs ⋮ Bipartite graphs, upward drawings, and planarity ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ Finding the \(k\) smallest spanning trees ⋮ Dynamic algorithms for shortest paths in planar graphs ⋮ Maintenance of triconnected components of graphs ⋮ Average case analysis of fully dynamic reachability for directed graphs
This page was built for publication:
