Pages that link to "Item:Q1098631"

The following pages link to Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees (Q1098631):

Displaying 7 items.

• Efficient computation of tolerances in the weighted independent set problem for trees (Q378171) (← links)
• Static and dynamic parallel computation of connected components (Q1322111) (← links)
• A subtree-partitioning algorithm for inducing parallelism in network simplex dual updates (Q1360244) (← links)
• Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree (Q1816995) (← links)
• Optimal parallel algorithms for multiple updates of minimum spanning trees (Q2366226) (← links)
• Associative parallel algorithm for dynamic update of a minimum spanning tree after addition of a new node to a graph (Q2501326) (← links)
• (Q3348416) (← links)