Pages that link to "Item:Q635330"
From MaRDI portal
The following pages link to Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330):
Displaying 6 items.
- Maximum metric spanning tree made Byzantine tolerant (Q494938) (← links)
- Self-stabilizing minimum degree spanning tree within one from the optimal degree (Q635330) (← links)
- A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458) (← links)
- A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
