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 |
| _version_ | 1811337848363679744 |
|---|---|
| author | Zainal Abidin Agus Zainal Arifin |
| author_facet | Zainal Abidin Agus Zainal Arifin |
| author_sort | Zainal Abidin |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-13T18:02:00Z |
| format | Article |
| id | doaj.art-b59d445c34b742898341ebcbdd6bbfe8 |
| institution | Directory Open Access Journal |
| issn | 2086-0382 2477-3344 |
| language | English |
| last_indexed | 2024-04-13T18:02:00Z |
| publishDate | 2010-05-01 |
| publisher | Mathematics Department UIN Maulana Malik Ibrahim Malang |
| record_format | Article |
| series | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| spelling | doaj.art-b59d445c34b742898341ebcbdd6bbfe82022-12-22T02:36:14ZengMathematics Department UIN Maulana Malik Ibrahim MalangCauchy: Jurnal Matematika Murni dan Aplikasi2086-03822477-33442010-05-01129710610.18860/ca.v1i2.17061516Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja KomputasiZainal Abidin0Agus Zainal Arifin1Dosen Teknik Informatika UIN Maliki MalangJurusan Informatika Fakultas Teknologi Informatika Institut Teknologi Sepuluh Nopember (ITS)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.https://ejournal.uin-malang.ac.id/index.php/Math/article/view/1706random grapherdos royik-nearest neighbourcomputation time |
| spellingShingle | Zainal Abidin Agus Zainal Arifin Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi Cauchy: Jurnal Matematika Murni dan Aplikasi random graph erdos royi k-nearest neighbour computation time |
| title | Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi |
| title_full | Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi |
| title_fullStr | Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi |
| title_full_unstemmed | Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi |
| title_short | Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi |
| title_sort | membatasi k ketenggaan simpul dalam pembangkitan random graph metode erdos royi untuk meningkatkan kinerja komputasi |
| topic | random graph erdos royi k-nearest neighbour computation time |
| url | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/1706 |
| work_keys_str_mv | AT zainalabidin membatasikketenggaansimpuldalampembangkitanrandomgraphmetodeerdosroyiuntukmeningkatkankinerjakomputasi AT aguszainalarifin membatasikketenggaansimpuldalampembangkitanrandomgraphmetodeerdosroyiuntukmeningkatkankinerjakomputasi |