Finding k-Highest Betweenness Centrality Vertices in Graphs

Cited 6 time in webofscience Cited 8 time in scopus
  • Hit : 438
  • Download : 273
DC FieldValueLanguage
dc.contributor.authorChung, Chin-Wanko
dc.contributor.authorLee, Min-joongko
dc.date.accessioned2014-08-28T07:33:48Z-
dc.date.available2014-08-28T07:33:48Z-
dc.date.created2014-02-13-
dc.date.created2014-02-13-
dc.date.issued2014-04-09-
dc.identifier.citation23rd International Conference on World Wide Web, WWW 2014, pp.339 - 340-
dc.identifier.urihttp://hdl.handle.net/10203/188305-
dc.description.abstractThe betweenness centrality is a measure for the relative participation of the vertex in the shortest paths in the graph. In many cases, we are interested in the k-highest betweenness centrality vertices only rather than all the vertices in a graph. In this paper, we study an efficient algorithm for finding the exact k-highest betweenness centrality vertices.-
dc.languageEnglish-
dc.publisherAssociation for Computing Machinery, Inc-
dc.titleFinding k-Highest Betweenness Centrality Vertices in Graphs-
dc.typeConference-
dc.identifier.wosid000455947000116-
dc.identifier.scopusid2-s2.0-84990945104-
dc.type.rimsCONF-
dc.citation.beginningpage339-
dc.citation.endingpage340-
dc.citation.publicationname23rd International Conference on World Wide Web, WWW 2014-
dc.identifier.conferencecountryKO-
dc.identifier.conferencelocationSeoul-
dc.identifier.doi10.1145/2567948.2577358-
dc.embargo.liftdate9999-12-31-
dc.embargo.terms9999-12-31-
dc.contributor.localauthorChung, Chin-Wan-
Appears in Collection
CS-Conference Papers(학술회의논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0