Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi
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.
restriction by k-nearest neighbour can be reduced computation time.
Keywords
random Graph; erdos royi; k-nearest neighbour; computation time
DOI: https://doi.org/10.18860/ca.v1i2.1706
Refbacks
- There are currently no refbacks.
Copyright (c) 2010 Zainal Abidin, Agus Zainal Arifin
![Creative Commons License](http://licensebuttons.net/l/by-sa/4.0/88x31.png)
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Editorial Office
Mathematics Department,
Universitas Islam Negeri Maulana Malik Ibrahim Malang
Gajayana Street 50 Malang, East Java, Indonesia 65144
Faximile (+62) 341 558933
e-mail: cauchy@uin-malang.ac.id
CAUCHY: Jurnal Matematika Murni dan Aplikasi is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.