TY - GEN
T1 - Hierarchical vertex ordering
AU - Woo, Sung Ho
AU - Yang, Sung Bong
PY - 2002
Y1 - 2002
N2 - The k-way graph partitioning problem has been solved well through vertex ordering and dynamic programming which splits a vertex order into k clusters [2,12]. In order to obtain “good clusters” in terms of the partitioning objective, tightly connected vertices in a given graph should be closely placed on the vertex order. In this paper we present a simple vertex ordering method called hierarchical vertex ordering (HVO). Given a weighted undirected graph, HVO generates a series of graphs through graph matching to construct a tree. A vertex order is then obtained by visiting each nonleaf node in the tree and by ordering its children properly. In the experiments, dynamic programming [2] is applied to the vertex orders generated by HVO as well as various vertex ordering methods [1,6,9,10,11] in order to solve the k-way graph partitioning problem. The solutions derived from the vertex orders are then comapred. Our experimental results show that HVO outperforms other methods for almost all cases in terms of the partitioning objective. HVO is also very simple and straightforward.
AB - The k-way graph partitioning problem has been solved well through vertex ordering and dynamic programming which splits a vertex order into k clusters [2,12]. In order to obtain “good clusters” in terms of the partitioning objective, tightly connected vertices in a given graph should be closely placed on the vertex order. In this paper we present a simple vertex ordering method called hierarchical vertex ordering (HVO). Given a weighted undirected graph, HVO generates a series of graphs through graph matching to construct a tree. A vertex order is then obtained by visiting each nonleaf node in the tree and by ordering its children properly. In the experiments, dynamic programming [2] is applied to the vertex orders generated by HVO as well as various vertex ordering methods [1,6,9,10,11] in order to solve the k-way graph partitioning problem. The solutions derived from the vertex orders are then comapred. Our experimental results show that HVO outperforms other methods for almost all cases in terms of the partitioning objective. HVO is also very simple and straightforward.
UR - http://www.scopus.com/inward/record.url?scp=84937232482&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937232482&partnerID=8YFLogxK
U2 - 10.1007/3-540-45832-8_29
DO - 10.1007/3-540-45832-8_29
M3 - Conference contribution
AN - SCOPUS:84937232482
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 393
EP - 401
BT - Graph Transformation - 1st International Conference, ICGT 2002, Proceedings
A2 - Corradini, Andrea
A2 - Ehrig, Hartmut
A2 - Kreowski, Hans-Jörg
A2 - Rozenberg, Grzegorz
PB - Springer Verlag
T2 - 1st International Conference on Graph Transformation, ICGT 2002
Y2 - 7 October 2002 through 12 October 2002
ER -