Pages that link to "Item:Q450578"
From MaRDI portal
The following pages link to An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578):
Displaying 5 items.
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Consensus of nonlinear multi-agent systems with directed switching graphs: a directed spanning tree based error system approach (Q1698450) (← links)
- Observer-based consensus for multi-agent systems with partial adaptive dynamic protocols (Q2304029) (← links)
- Distributed Consensus for Multiagent Systems via Directed Spanning Tree Based Adaptive Control (Q4568062) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
