Pages that link to "Item:Q3022016"
From MaRDI portal
The following pages link to THE FIRST APPROXIMATED DISTRIBUTED ALGORITHM FOR THE MINIMUM DEGREE SPANNING TREE PROBLEM ON GENERAL GRAPHS (Q3022016):
Displaying 5 items.
- A distributed approximation algorithm for the minimum degree minimum weight spanning trees (Q436669) (← links)
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← links)
- Unconditional lower bounds on the time-approximation tradeoffs for the distributed minimum spanning tree problem (Q3580979) (← links)
- Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs (Q5197676) (← links)