Pages that link to "Item:Q2377384"
From MaRDI portal
The following pages link to A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks (Q2377384):
Displaying 4 items.
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks. (Q1398776) (← links)
- Connected domination in maximal outerplanar graphs (Q2192107) (← links)
- Self-Stabilizing Domination Algorithms (Q3384122) (← links)