scientific article; zbMATH DE number 177564
From MaRDI portal
Publication:4037435
zbMATH Open0764.68066MaRDI QIDQ4037435FDOQ4037435
Authors: David Eppstein
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- Maintenance of a minimum spanning forest in a dynamic plane graph
- Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
- Maintaining minimum spanning trees in dynamic graphs
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
offline algorithmsmaintaining a minimum spanning treeoffline geometric MST problem for a planar point set
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (8)
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- Approximating multistage matching problems
- Approximating multistage matching problems
- Average case analysis of dynamic geometric optimization
- Finding the \(k\) smallest spanning trees
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
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 Q4037435)