Metadata
Author: ParaCrawl Corpus
Data
English[en]
You can choose between reducing the following two problems: Graph Coloring kth.adk.npreduction1) and Hamiltonian Cycle kth.adk.npreduction2.
Swedish[sv]
Du får välja mellan att reducera problemen Graffärgning (problem-id kth.adk.npreduction1) och Hamiltonsk cykel (problem-id kth.adk.npreduction2).