V and the set of vertices of a host graph H = (N,EH) with N = {0,··· ,n−1}. Graph labeling problems are then defined as finding the best ...
確定! 回上一頁