Pages that link to "Item:Q5311527"
From MaRDI portal
The following pages link to Parameterized and Exact Computation (Q5311527):
Displaying 11 items.
- FPT algorithms for path-transversal and cycle-transversal problems (Q456698) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- Parameterized graph separation problems (Q820151) (← links)
- A note on triple separation of a graph (Q1196579) (← links)
- Isolation branching: a branch and bound algorithm for the \(k \)-terminal cut problem (Q2082183) (← links)
- Clustering with partial information (Q2268879) (← links)
- On treewidth, separators and Yao's garbling (Q2697873) (← links)
- Treewidth reduction for constrained separation and bipartization problems (Q3113780) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- An approach to emulating separable graphs (Q4277376) (← links)