Pages that link to "Item:Q1879365"
From MaRDI portal
The following pages link to Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs (Q1879365):
Displaying 26 items.
- Backup 2-center on interval graphs (Q442280) (← links)
- The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
- 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)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- An improved algorithm for the \(p\)-center problem on interval graphs with unit lengths (Q868984) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- An approximation result for the interval coloring problem on claw-free chordal graphs (Q1613366) (← links)
- On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- A branch-and-price algorithm for the minimum sum coloring problem (Q1983110) (← links)
- Declawing a graph: polyhedra and branch-and-cut algorithms (Q2045043) (← 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)
- Mutual exclusion scheduling with interval graphs or related classes. II (Q2476265) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Vertex disjoint copies of \(K_{1 , 4}\) in claw-free graphs (Q2662607) (← links)
- Minimum sum coloring of \(P_{4}\)-sparse graphs (Q2840552) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- Min Sum Edge Coloring in Multigraphs Via Configuration LP (Q3503859) (← links)
- Sum Multicoloring of Graphs (Q4521523) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)
- Approximation and Online Algorithms (Q5713450) (← links)
