Show simple item record

Using preprocessing to speed up Brandes’ betweenness centrality algorithm

dc.rights.licenseCC-BY-NC-ND
dc.contributor.advisorBisseling, R. H.
dc.contributor.authorFleuren, S.
dc.date.accessioned2018-02-14T18:01:18Z
dc.date.available2018-02-14T18:01:18Z
dc.date.issued2018
dc.identifier.urihttps://studenttheses.uu.nl/handle/20.500.12932/28624
dc.description.sponsorshipUtrecht University
dc.format.extent392224
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.titleUsing preprocessing to speed up Brandes’ betweenness centrality algorithm
dc.type.contentBachelor Thesis
dc.rights.accessrightsOpen Access
dc.subject.keywordsgraph theory, betweenness centrality, Brandes' algorithm, biconnected component
dc.subject.courseuuWiskunde


Files in this item

Thumbnail
Name:
scriptie_Brandes (6).pdf
Size:
383.0Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record