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