Pages that link to "Item:Q2285134"
From MaRDI portal
The following pages link to Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134):
Displaying 5 items.
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Parameterized algorithms for minimum tree cut/paste distance and minimum common integer partition (Q777276) (← links)
- An improved approximation algorithm for the minimum common integer partition problem (Q2051801) (← links)
- Fixed-parameter tractability for the Tree Assembly problem (Q2232586) (← links)
- Fixed Parameter Tractability of Crossing Minimization of Almost-Trees (Q2867670) (← links)