Muaminah , Rita (1994) Matriks boolen, algoritma malgrages dan pemetaan pada graph. Undergraduate thesis, FMIPA UNDIP.
![[img]](/style/images/fileicons/application_pdf.png) | PDF Restricted to Repository staff only 2307Kb | |
| PDF 19Kb | |
| PDF 216Kb | |
| PDF 364Kb | |
| PDF 284Kb | |
| PDF 521Kb | |
| PDF 660Kb | |
| PDF Restricted to Repository staff only 747Kb | |
| PDF 220Kb | |
| PDF 227Kb |
Abstract
Suatu graph yano disajikan dalam Matriks Boolean dan ditentukan Covernya, maka dapat dicari himpunan submatriks primernya. . = [ I .3 ] Jika didefinisikan dan [ ] 2 2- 2 masino-masing merupakan submatrik=. lengkap HA.ri suatu Cover matriks Boolean, make = J U J2 1 Operasi diatas dipakai dalam Alooritma Malorange's. Almoritma ini merupkAn suatu Craa untuk mencari himpunan =AA rprimer .1.1 • • • • • 4 ff • 2 2 Li +7i 1, .1- tic Ck Alooritma Malgranoe's mempermudah dalam mencari hasil .-,t_tttu graph into grph. vi
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Subjects: | Q Science > QA Mathematics |
| Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
| ID Code: | 31393 |
| Deposited By: | Mr UPT Perpus 1 |
| Deposited On: | 21 Nov 2011 10:02 |
| Last Modified: | 21 Nov 2011 10:02 |
Repository Staff Only: item control page
