Hierarchical vertex ordering

Sung Ho Woo, Sung Bong Yang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish
Title of host publicationGraph Transformation - 1st International Conference, ICGT 2002, Proceedings
EditorsAndrea Corradini, Hartmut Ehrig, Hans-Jörg Kreowski, Grzegorz Rozenberg
PublisherSpringer Verlag
Pages393-401
Number of pages9
ISBN (Electronic)9783540443100
DOIs
Publication statusPublished - 2002
Event1st International Conference on Graph Transformation, ICGT 2002 - Barcelona, Spain
Duration: 2002 Oct 72002 Oct 12

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2505
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Graph Transformation, ICGT 2002
CountrySpain
CityBarcelona
Period02/10/702/10/12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Hierarchical vertex ordering'. Together they form a unique fingerprint.

  • Cite this

    Woo, S. H., & Yang, S. B. (2002). Hierarchical vertex ordering. In A. Corradini, H. Ehrig, H-J. Kreowski, & G. Rozenberg (Eds.), Graph Transformation - 1st International Conference, ICGT 2002, Proceedings (pp. 393-401). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2505). Springer Verlag. https://doi.org/10.1007/3-540-45832-8_29