formulating an appropriate optimization problem on weighted graphs, where the weights capture if two nodes in the
DOM tree should be placed together. Liu et al.,7 proposed a novel Web page segmentation algorithm based on
finding the Gomory-Hu tree in a planar graph. The algorithm initially distils vision and structure information from a
Web page to construct a weighted undirected graph, whose vertices are the leaf nodes of the DOM tree and the edges
represent the visible position relationship between vertices. It then partitions the graph with the Gomory-Hu tree
based clustering algorithm. Since the graph is a planar graph, the algorithm is very efficient.