共 19 条
- [1] Zvi G(1988)An o (n2 (m+ n log n) log n) min-cost flow algorithm J. the ACM (JACM) 35 374-386
- [2] Éva T(1989)Finding minimum-cost circulations by canceling negative cycles J. ACM 36 873-886
- [3] Goldberg AV(1987)Using tabu search techniques for graph coloring Computing 39 345-351
- [4] Tarjan RE(1996)A column generation approach for graph coloring INFORMS J. Comput. 8 344-354
- [5] Hertz A(1982)Register allocation & spilling via graph coloring ACM Sigplan Notices 17 98-101
- [6] de Werra D(2017)Ant colony system for graph coloring problem International Journal of Engineering Science and Computing 7 14120-14125
- [7] Trick MA(2017)Effective and efficient dynamic graph coloring Proc. VLDB Endow. 11 338-351
- [8] Mehrotra A(1981)The application of a graph coloring method to an examination scheduling problem INFORMS J. Appl. Anal. 11 57-65
- [9] Chaitin GJ(undefined)undefined undefined undefined undefined-undefined
- [10] Karthikeyan R(undefined)undefined undefined undefined undefined-undefined