Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
SLO
Login
Search
Browsing
Upload document
Statistics
RUP
FAMNIT - Faculty of Mathematics, Science and Information Technologies
FHŠ - Faculty of Humanities
FM - Faculty of Management
FTŠ Turistica - Turistica – College of Tourism Portorož
FVZ - Faculty of Health Sciences
IAM - Andrej Marušič Institute
PEF - Faculty of Education
UPR - University of Primorska
ZUP - University of Primorska Press
COBISS
University of Primorska, University Library - all departments
First page
/
Show document
Show document
A-
|
A+
|
Print
Title:
Particija grafa, odkrivanje skupnosti in maksimalen prerez : magistrsko delo
Authors:
ID
Muršič, Peter
(Author)
ID
Stevanović, Dragan
(Mentor)
More about this mentor...
ID
Milanič, Martin
(Comentor)
Files:
http://www.famnit.upr.si/sl/izobrazevanje/zakljucna_dela/view/64
Language:
Slovenian
Work type:
Master's thesis/paper
Typology:
2.09 - Master's Thesis
Organization:
FAMNIT - Faculty of Mathematics, Science and Information Technologies
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
Place of publishing:
Koper
Place of performance:
Koper
Publisher:
[P. Muršič]
Year of publishing:
2012
Year of performance:
2012
Number of pages:
VI, 49 f.
PID:
20.500.12556/RUP-8749
UDC:
519.17(043.2)
COBISS.SI-ID:
1024446548
Publication date in RUP:
13.11.2017
Views:
3015
Downloads:
58
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
MURŠIČ, Peter, 2012,
Particija grafa, odkrivanje skupnosti in maksimalen prerez : magistrsko delo
[online]. Master’s thesis. Koper : P. Muršič. [Accessed 3 April 2025]. Retrieved from: http://www.famnit.upr.si/sl/izobrazevanje/zakljucna_dela/view/64
Copy citation
Average score:
0.5
1
1.5
2
2.5
3
3.5
4
4.5
5
(0 votes)
Your score:
Voting is allowed only for
logged in
users.
Share:
Similar works from our repository:
No similar works found
Similar works from other repositories:
Tehniški pravopis
Vejice v vabilih
Stopnjevanje prislovov
Udejanili ali udejanjili
Kaj pomeni 'krucijalno'
Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.
Secondary language
Language:
English
Title:
Graph partitioning, community detection and max cut
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
Comments
Leave comment
You must
log in
to leave a comment.
Comments (0)
0 - 0 / 0
There are no comments!
Back