Aditya, Ricky (2019) Algoritma “Hancurkan Semua Sikel” untuk Menentukan Pohon Perentang Minimum Dari Suatu Graf Berbobot. Jurnal Ilmiah MATRIK, 21 (02). pp. 91-98. ISSN 1411-1624 (Print); 2621-8089 (Online)
![[img]](http://repository.usd.ac.id/style/images/fileicons/text.png) |
Text
7754_algoritma.pdf Download (1MB) |
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Technology > Department of Mathematics |
| Depositing User: | Y. Etik Supriyanti |
| Date Deposited: | 22 Feb 2022 02:29 |
| Last Modified: | 22 Feb 2022 02:29 |
| URI: | http://repository.usd.ac.id/id/eprint/42008 |
Actions (login required)
 |
View Item |
