TY - JOUR
T1 - On the modification Highly Connected Subgraphs (HCS) algorithm in graph clustering for weighted graph
AU - Albirri, E. R.
AU - Sugeng, K. A.
AU - Aldila, D.
N1 - Publisher Copyright:
© Published under licence by IOP Publishing Ltd.
PY - 2018/4/27
Y1 - 2018/4/27
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85047405005&partnerID=8YFLogxK
U2 - 10.1088/1742-6596/1008/1/012037
DO - 10.1088/1742-6596/1008/1/012037
M3 - Conference article
AN - SCOPUS:85047405005
SN - 1742-6588
VL - 1008
JO - Journal of Physics: Conference Series
JF - Journal of Physics: Conference Series
IS - 1
M1 - 012037
T2 - 1st International Conference of Combinatorics, Graph Theory, and Network Topology, ICCGANT 2017
Y2 - 25 November 2017 through 26 November 2017
ER -
