Pages that link to "Item:Q1383159"
From MaRDI portal
The following pages link to On chromatic sums and distributed resource allocation (Q1383159):
Displayed 11 items.
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Multicoloring trees. (Q1401922) (← links)
- The maximum saving partition problem (Q1779697) (← links)
- On sum coloring of graphs (Q1811069) (← links)
- OVSF-CDMA code assignment in wireless ad hoc networks (Q2471712) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph (Q5445753) (← links)