DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chung, Chin-Wan | ko |
dc.contributor.author | Lee, Min-joong | ko |
dc.date.accessioned | 2014-08-28T07:33:48Z | - |
dc.date.available | 2014-08-28T07:33:48Z | - |
dc.date.created | 2014-02-13 | - |
dc.date.created | 2014-02-13 | - |
dc.date.issued | 2014-04-09 | - |
dc.identifier.citation | 23rd International Conference on World Wide Web, WWW 2014, pp.339 - 340 | - |
dc.identifier.uri | http://hdl.handle.net/10203/188305 | - |
dc.description.abstract | The 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.language | English | - |
dc.publisher | Association for Computing Machinery, Inc | - |
dc.title | Finding k-Highest Betweenness Centrality Vertices in Graphs | - |
dc.type | Conference | - |
dc.identifier.wosid | 000455947000116 | - |
dc.identifier.scopusid | 2-s2.0-84990945104 | - |
dc.type.rims | CONF | - |
dc.citation.beginningpage | 339 | - |
dc.citation.endingpage | 340 | - |
dc.citation.publicationname | 23rd International Conference on World Wide Web, WWW 2014 | - |
dc.identifier.conferencecountry | KO | - |
dc.identifier.conferencelocation | Seoul | - |
dc.identifier.doi | 10.1145/2567948.2577358 | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Chung, Chin-Wan | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.