Pages that link to "Item:Q1816995"
From MaRDI portal
The following pages link to Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995):
Displaying 6 items.
- Static and dynamic parallel computation of connected components (Q1322111) (← links)
- Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
- Variable neighborhood decomposition search for the edge weighted \(k\)-cardinality tree problem (Q1885977) (← links)
- Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph (Q2501326) (← links)
- An efficient parallel algorithm for multiple edge updates of minimum spanning trees on sparse graphs (Q2769372) (← links)
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications (Q3694711) (← links)
