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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining dynamic minimum spanning trees: an experimental study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for updating minimal spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for a special case of disjoint set union / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Advances in Fully Dynamic Graph Algorithms – A Quick Reference Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining minimum spanning trees in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the most vital edge with respect to minimum spanning tree in weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for finding the most vital edge of a minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal minimum spanning tree algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding and Updating Spanning Trees and Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding the bridges of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of Path Compression on Balanced Trees / rank
 
Normal rank

Revision as of 20:39, 31 July 2024

scientific article; zbMATH DE number 7670318
Language Label Description Also known as
English
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
scientific article; zbMATH DE number 7670318

    Statements

    A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges (English)
    0 references
    0 references
    0 references
    30 March 2023
    0 references

    Identifiers