#TITLE_ALTERNATIVE#
An f-coloring of a simple graph G = (V,E) is to color each edge in G so that, each color appears at each vertex v at most f(v) times where f : V → ℵ. Since f-coloring where f(v) = 1 for each vertex v ∈ V is NP-complete problem, then in general, f-coloring is NP-complete...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Final Project |
| 語言: | Indonesia |
| 在線閱讀: | https://digilib.itb.ac.id/gdl/view/8287 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Institut Teknologi Bandung |
| 語言: | Indonesia |