✦ LIBER ✦
A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs
✍ Scribed by A. Hertz
- Publisher
- Springer
- Year
- 1994
- Tongue
- English
- Weight
- 363 KB
- Volume
- 27
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.