Pages that link to "Item:Q5363764"
From MaRDI portal
The following pages link to Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs (Q5363764):
Displaying 6 items.
- The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
- (Q3140457) (← links)
- The Complexity of Finding (Approximate Sized) Distance-d Dominating Set in Tournaments (Q4632200) (← links)
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)