On the modification Highly Connected Subgraphs (HCS) algorithm in graph clustering for weighted graph

E. R. Albirri, Kiki Ariyanti, Dipo Aldila

Research output: Contribution to journalConference articlepeer-review

2 Citations (Scopus)

Abstract

Nowadays, in the modern world, since technology and human civilization start to progress, all city in the world is almost connected. The various places in this world are easier to visit. It is an impact of transportation technology and highway construction. The cities which have been connected can be represented by graph. Graph clustering is one of ways which is used to answer some problems represented by graph. There are some methods in graph clustering to solve the problem spesifically. One of them is Highly Connected Subgraphs (HCS) method. HCS is used to identify cluster based on the graph connectivity k for graph G. The connectivity in graph G is denoted by that n is the total of vertices in G, then it is called as HCS or the cluster. This research used literature review and completed with simulation of program in a software. We modified HCS algorithm by using weighted graph. The modification is located in the Process Phase. Process Phase is used to cut the connected graph G into two subgraphs H and . We also made a program by using software Octave-401. Then we applied the data of Flight Routes Mapping of One of Airlines in Indonesia to our program.

Original languageEnglish
Article number012037
JournalJournal of Physics: Conference Series
Volume1008
Issue number1
DOIs
Publication statusPublished - 27 Apr 2018
Event1st International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2017 - Jember, East Java, Indonesia
Duration: 25 Nov 201726 Nov 2017

Fingerprint Dive into the research topics of 'On the modification Highly Connected Subgraphs (HCS) algorithm in graph clustering for weighted graph'. Together they form a unique fingerprint.

Cite this