Greedy and heuristic algorithms for codes and colorings. Abstract: Many of the fundamental coding problems can be represented as graph problems.
確定! 回上一頁