Maintaining minimum spanning trees in dynamic graphs (Q4571989): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-63165-8_214
+Normal rank
@@ Property / OpenAlex ID @@
+W2128744826
@@ Property / OpenAlex ID: W2128744826 / rank @@
+Normal rank
@@ Property / cites work @@
+Dynamic Euclidean minimum spanning trees and extrema of binary functions
+Normal rank
@@ Property / cites work @@
+Separator based sparsification for dynamic planar graph algorithms
+Normal rank
@@ Property / cites work @@
+Q4230327
@@ Property / cites work: Q4230327 / rank @@
+Normal rank
@@ Property / cites work @@
+An On-Line Edge-Deletion Problem
@@ Property / cites work: An On-Line Edge-Deletion Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
+Normal rank
@@ Property / cites work @@
+Q4234100
@@ Property / cites work: Q4234100 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4818842
@@ Property / cites work: Q4818842 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3219751
@@ Property / cites work: Q3219751 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank