The following pages link to (Q4691777):
Displaying 9 items.
- Exact and approximate algorithms for movement problems on (special classes of) graphs (Q338392) (← links)
- A short note on the complexity of computing strong pathbreadth (Q1705708) (← links)
- On \textsf{NC} algorithms for problems on bounded rank-width graphs (Q1799577) (← links)
- Rectilinear path problems in restricted memory setup (Q2357163) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- (Q3125666) (← links)
- FPT Algorithms for Path-Transversals and Cycle-Transversals Problems in Graphs (Q3503584) (← links)
- The Complexity of Finding Paths in Graphs with Bounded Independence Number (Q5317191) (← links)
- Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711) (← links)
