<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.upr.si/IzpisGradiva.php?id=8749"><dc:title>Particija grafa, odkrivanje skupnosti in maksimalen prerez</dc:title><dc:creator>Muršič,	Peter	(Avtor)
	</dc:creator><dc:creator>Stevanović,	Dragan	(Mentor)
	</dc:creator><dc:creator>Milanič,	Martin	(Komentor)
	</dc:creator><dc:subject>particija grafa</dc:subject><dc:subject>odkrivanje skupnosti</dc:subject><dc:subject>algoritem Kernighan-Lin</dc:subject><dc:subject>maksimalen prerez</dc:subject><dc:subject>spektralna particija</dc:subject><dc:subject>modularnost</dc:subject><dc:subject>enostavna maksimizacija modularnosti</dc:subject><dc:subject>spektralna maksimizacija modularnosti</dc:subject><dc:subject>bisekcija grafa</dc:subject><dc:subject>hierarhično grozdenje</dc:subject><dc:subject>hevristike</dc:subject><dc:subject>aproksimacijski algoritmi</dc:subject><dc:subject>dendrogram</dc:subject><dc:publisher>[P. Muršič]</dc:publisher><dc:date>2012</dc:date><dc:date>2017-11-13 08:41:30</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>8749</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>