The optimal cost chromatic partition problem for trees and interval graphs

DOI10.1007/3-540-62559-3_23zbMATH Open1539.68228MaRDI QIDQ6550551

Asim Roy, Leo G. Kroon, Arunabha Sen, Haiyong Deng

Publication date: 5 June 2024

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational complexity of (maximum) shift class scheduling
• Scheduling jobs with fixed start and end times
• The maximum k-colorable subgraph problem for chordal graphs
• On the computational complexity of (maximum) class scheduling
• On a graph partition problem with application to VLSI layout
• License class design: Complexity and algorithms
• Geometric algorithms and combinatorial optimization
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times
• An analysis of shift class design problems
• On certain polytopes associated with graphs
• The Fixed Job Schedule Problem with Spread-Time Constraints
• The Fixed Job Schedule Problem with Working-Time Constraints
• The Complexity of Coloring Circular Arcs and Chords
• Games of Boldness, Where the Player Performing the Hardest Task Wins
• Approximation Algorithms for Fixed Job Schedule Problems
• Perfect zero–one matrices
• The Strong Perfect Graph Conjecture for Planar Graphs

This page was built for publication: The optimal cost chromatic partition problem for trees and interval graphs