The following pages link to Multicoloring trees. (Q1401922):
Displaying 21 items.
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Minimally colored trees (Q908876) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Scheduling jobs on identical machines with agreement graph (Q1761988) (← links)
- Optimal shift coloring of trees (Q1785225) (← links)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs (Q1879365) (← links)
- Window-based greedy contention management for transactional memory: theory and practice (Q1938368) (← links)
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph (Q2125230) (← links)
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2149860) (← links)
- A competitive analysis for balanced transactional memory workloads (Q2429336) (← links)
- Bandwidth consecutive multicolorings of graphs (Q2445874) (← links)
- Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Scheduling: agreement graph vs resource constraints (Q2629638) (← links)
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints (Q2680859) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- Sum Multicoloring of Graphs (Q4521523) (← links)
- Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees (Q4538085) (← links)
- Tight Lower Bounds for the Complexity of Multicoloring (Q5111704) (← links)
- Automata, Languages and Programming (Q5716832) (← links)
