Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi
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 o...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mathematics Department UIN Maulana Malik Ibrahim Malang
2010-05-01
|
| Series: | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| Subjects: | |
| Online Access: | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/1706 |