Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi

Zainal Abidin, Agus Zainal Arifin

Abstract


Edges generation by random graph erdos-royi methods was needed high computation, it’s caused low performance. In fact, edge generation was used frequently with many nodes. this paper is described a node restriction by k-nearest neighbour on edge generation of random graph erdos royi method. Result of node
restriction by k-nearest neighbour can be reduced computation time.

Keywords


random Graph; erdos royi; k-nearest neighbour; computation time

Full Text:

PDF PS


DOI: http://dx.doi.org/10.18860/ca.v1i2.1706

Refbacks

  • There are currently no refbacks.




Editorial Office
Mathematics Department,
Universitas Islam Negeri Maulana Malik Ibrahim Malang
Jalan Gajayana 50 Malang, Jawa Timur, Indonesia 65144
Faximile (+62) 341 558933
e-mail: cauchy@uin-malang.ac.id
 

Creative Commons License
Cauchy (ISSN: 2086-0382 / E-ISSN: 2477-3344) by http://ejournal.uin-malang.ac.id/index.php/Math is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.