Algoritma pembesaran optimal pada graph campuran guna memperoleh graph terhubung kuat

Format: Bachelors
Terbitan: Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia , 1990
Subjects:
ctrlnum 20180401
fullrecord <?xml version="1.0"?> <dc schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><title>Algoritma pembesaran optimal pada graph campuran guna memperoleh graph terhubung kuat</title><creator/><type>Thesis:Bachelors</type><place/><publisher>Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia</publisher><date>1990</date><description/><subject>Mixed graphs</subject><subject>Approximation algorithms</subject><identifier>20180401</identifier><recordID>20180401</recordID></dc>
format Thesis:Bachelors
Thesis
title Algoritma pembesaran optimal pada graph campuran guna memperoleh graph terhubung kuat
publisher Fakultas Matematika dan Ilmu Pengetahuan Alam Universitas Indonesia
publishDate 1990
topic Mixed graphs
Approximation algorithms
id IOS18064.20180401
institution Universitas Indonesia
institution_id 51
institution_type library:university
library
library Perpustakaan Universitas Indonesia
library_id 492
collection Repository Skripsi (open) Universitas Indonesia
repository_id 18064
city KOTA DEPOK
province JAWA BARAT
repoId IOS18064
first_indexed 2022-12-13T09:05:22Z
last_indexed 2022-12-13T09:05:22Z
recordtype dc
merged_child_boolean 1
_version_ 1752192293601804288
score 17.538404