The following pages link to (Q4035355):
Displaying 7 items.
- Slightly Superexponential Parameterized Problems (Q5745079) (← links)
- A 3-approximation for the pathwidth of Halin graphs (Q5898649) (← links)
- Using a hybrid of exact and genetic algorithms to design survivable networks (Q5955471) (← links)
- Connected search for a lazy robber (Q6080862) (← links)
- Fast searching on \(k\)-combinable graphs (Q6111627) (← links)
- Edge searching and fast searching with constraints (Q6122599) (← links)
- Constrained graph searching on trees (Q6535820) (← links)