Pages that link to "Item:Q652536"
From MaRDI portal
The following pages link to A new algorithm for finding trees with many leaves (Q652536):
Displaying 8 items.
- Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- Parameterized complexity of multi-node hubs (Q2084737) (← links)
- Parameterized Complexity of Multi-Node Hubs (Q5009470) (← links)
- Finding \(k\)-secluded trees faster (Q6133646) (← links)
