The optimum cost chromatic partition problem
- 1 January 1997
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The Optimal Cost Chromatic Partition problem for trees and interval graphsLecture Notes in Computer Science, 1997
- Precoloring Extension III: Classes of Perfect GraphsCombinatorics, Probability and Computing, 1996
- Scheduling with incompatible jobsLecture Notes in Computer Science, 1993
- On a graph partition problem with application to VLSI layoutInformation Processing Letters, 1992
- Finding a Maximum Planar Subset of a Set of Nets in a ChannelIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1987
- Graph minors. II. Algorithmic aspects of tree-widthJournal of Algorithms, 1986
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A surveyBIT Numerical Mathematics, 1985
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975