Pages that link to "Item:Q5851096"
From MaRDI portal
The following pages link to The Parameterized Complexity of Some Minimum Label Problems (Q5851096):
Displaying 8 items.
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- The parameterized complexity of some minimum label problems (Q1959420) (← links)
- On the complexity of ``Superdetermined'' minrank instances (Q2302132) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- Sequence Hypergraphs (Q3181065) (← links)
- Dörfler marking with minimal cardinality is a linear complexity problem (Q5118851) (← links)
- Parameterized and Exact Computation (Q5311504) (← links)
- Sequence Hypergraphs: Paths, Flows, and Cuts (Q6163626) (← links)