Pages that link to "Item:Q4268880"
From MaRDI portal
The following pages link to Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete (Q4268880):
Displaying 14 items.
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- The transportation problem with conflicts (Q829180) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- Minimum Sum Coloring of P4-sparse graphs (Q2840552) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- On the approximability of time disjoint walks (Q5918517) (← links)
- Some polynomially solvable subcases of the detailed routing problem in VLSI design (Q5954248) (← links)
