A New Polynomial Time Algorithm for the Maximum Weighted ( (G) - 1)-Coloring Problem in Comparability Graphs

Technical Report (1991)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	GERAD - Research Group in Decision Analysis
PolyPublie URL:	https://publications.polymtl.ca/63542/
Report number:	G-91-38
Official URL:	https://www.gerad.ca/fr/papers/G-91-38
Date Deposited:	07 Apr 2025 13:34
Last Modified:	07 Apr 2025 13:34

Cite in APA 7:	Hertz, A. (1991). A New Polynomial Time Algorithm for the Maximum Weighted ( (G) - 1)-Coloring Problem in Comparability Graphs. (Technical Report n° G-91-38). https://www.gerad.ca/fr/papers/G-91-38

Stats are not available on this system.

View Item