Particija grafa, odkrivanje skupnosti in maksimalen prerez

magistrsko delo

Peter Muršič (Author), Dragan Stevanović (Mentor), Martin Milanič (Co-mentor)

Abstract

No abstract data available

Keywords

particija grafa;odkrivanje skupnosti;algoritem Kernighan-Lin;maksimalen prerez;spektralna particija;modularnost;enostavna maksimizacija modularnosti;spektralna maksimizacija modularnosti;bisekcija grafa;hierarhično grozdenje;hevristike;aproksimacijski algoritmi;dendrogram;

Data

Language:	Slovenian
Year of publishing:	2012
Typology:	2.09 - Master's Thesis
Organization:	UP - University of Primorska
Publisher:	[P. Muršič]
UDC:	519.17(043.2)
COBISS:	1024446548
Views:	2054
Downloads:	50
Average score:	0 (0 votes)
Metadata:

Other data

Secondary language:	English
Secondary title:	Graph partitioning, community detection and max cut
Secondary keywords:	graph partitioning;community detection;Kernighan-Lin algorithm;max cut;spectral partitioning;modularity;simple modularity maximization;spectral modularity maximization;graph bisection;hierarchical clustering;heuristics;approximation algorithm;dendogram;
Type (COBISS):	Master's thesis/paper
Thesis comment:	Univ. na Primorskem, Fak. za matematiko, naravoslovje in informacijske tehnologije
Pages:	VI, 49 f.
ID:	10879127