Pages that link to "Item:Q1377673"
From MaRDI portal
The following pages link to Two-segmented channel routing is strong NP-complete (Q1377673):
Displaying 9 items.
- Two-segmented channel routing is strong NP-complete (Q1377673) (← links)
- Almost envy-freeness in group resource allocation (Q2202023) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- All-shortest-path 2-interval routing is NP-complete (Q2380872) (← links)
- (Q4259980) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)