Pages that link to "Item:Q1959420"
From MaRDI portal
The following pages link to The parameterized complexity of some minimum label problems (Q1959420):
Displayed 7 items.
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- On the rainbow connectivity of graphs: complexity and FPT algorithms (Q378215) (← links)
- Generalized rainbow connectivity of graphs (Q744052) (← links)
- On the hardness of labeled correlation clustering problem: a parameterized complexity view (Q896155) (← links)
- Secluded connectivity problems (Q1679225) (← links)
- Algorithms and complexity results for labeled correlation clustering problem (Q2253964) (← links)
- Finding disjoint paths in networks with star shared risk link groups (Q2344758) (← links)