英和和英

出典:『Wikipedia』 (2011/06/16 13:55 UTC 版)

英語による解説

引用

In graph theory, the graph bandwidth problem to label the n vertices v_i of a graph G with distinct integers f(v_i) so that the quantity is minimized (E is the edge set of G). The problem may be visualized as placing the vertices of a graph at distinct integer points along the x-axis so that the length of the longest edge is minimized. Such placement is called linear graph arrangement, linear graph layout or linear graph placement.