The following pages link to Algorithms and Computation (Q5712129):
Displayed 11 items.
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Parameterized leaf power recognition via embedding into graph products (Q786044) (← links)
- Structure and linear time recognition of 3-leaf powers (Q844175) (← links)
- Computing phylogenetic roots with bounded degrees and errors is NP-complete (Q860811) (← links)
- Exact leaf powers (Q982668) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- Parameterized Leaf Power Recognition via Embedding into Graph Products (Q5009478) (← links)
- Simplicial Powers of Graphs (Q5505654) (← links)
- On k- Versus (k + 1)-Leaf Powers (Q5505655) (← links)
- Recognizing <i>k</i> -Leaf Powers in Polynomial Time, for Constant <i>k</i> (Q6075860) (← links)