The following pages link to Spotting Trees with Few Leaves (Q3448789):
Displaying 6 items.
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Narrow sieves for parameterized paths and packings (Q2396725) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
