A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs 期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

A new polynomial-time algorithm for the maximum weighted (χ(G) — 1)-coloring problem in comparability graphs

摘要：
本文献已被 SpringerLink 等数据库收录！