A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (Q5886043): Difference between revisions

@@ Property / DOI @@
-.7155/jgaa.00609
@@ Property / DOI: 10.7155/jgaa.00609 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W4313303087
@@ Property / OpenAlex ID: W4313303087 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
+Normal rank
@@ Property / cites work @@
+Maintaining dynamic minimum spanning trees: an experimental study
+Normal rank
@@ Property / cites work @@
+Algorithms for updating minimal spanning trees
@@ Property / cites work: Algorithms for updating minimal spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
+Normal rank
@@ Property / cites work @@
+Trans-dichotomous algorithms for minimum spanning trees and shortest paths
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for a special case of disjoint set union
+Normal rank
@@ Property / cites work @@
+Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide
+Normal rank
@@ Property / cites work @@
+Maintaining minimum spanning trees in dynamic graphs
+Normal rank
@@ Property / cites work @@
+Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
+Normal rank
@@ Property / cites work @@
+Finding the most vital edge with respect to minimum spanning tree in weighted graphs
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding the most vital edge of a minimum spanning tree
+Normal rank
@@ Property / cites work @@
+On the shortest spanning subtree of a graph and the traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Algorithms and Computation
@@ Property / cites work: Algorithms and Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
+Normal rank
@@ Property / cites work @@
+An optimal minimum spanning tree algorithm
@@ Property / cites work: An optimal minimum spanning tree algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+On Finding and Updating Spanning Trees and Shortest Paths
+Normal rank
@@ Property / cites work @@
+A note on finding the bridges of a graph
@@ Property / cites work: A note on finding the bridges of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Applications of Path Compression on Balanced Trees
+Normal rank
@@ Property / DOI @@
+.7155/JGAA.00609
@@ Property / DOI: 10.7155/JGAA.00609 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5886043