Pages that link to "Item:Q967352"
From MaRDI portal
The following pages link to On complexity of minimum leaf out-branching problem (Q967352):
Displaying 10 items.
- An algorithmic metatheorem for directed treewidth (Q266806) (← links)
- On the algorithmic effectiveness of digraph decompositions and complexity measures (Q456704) (← links)
- Directed elimination games (Q896668) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← links)
- On Digraph Width Measures in Parameterized Algorithmics (Q3656861) (← links)
- (Q5743498) (← links)