Show simple item record

dc.creatorFragkou E., Katsaros D., Manolopoulos Y.en
dc.date.accessioned2023-01-31T07:38:54Z
dc.date.available2023-01-31T07:38:54Z
dc.date.issued2021
dc.identifier10.1145/3472163.3472182
dc.identifier.isbn9781450389914
dc.identifier.urihttp://hdl.handle.net/11615/71789
dc.description.abstractThis article introduces the concept of Sink Group Node Betweenness centrality to identify those nodes in a network that can "monitor"the geodesic paths leading towards a set of subsets of nodes; it generalizes both the traditional node betweenness centrality and the sink betweenness centrality. We also provide extensions of the basic concept for node-weighted networks, and also describe the dual notion of Sink Group Edge Betweenness centrality. We exemplify the merits of these concepts and describe some areas where they can be applied. © 2021 ACM.en
dc.language.isoenen
dc.sourceACM International Conference Proceeding Seriesen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85115091365&doi=10.1145%2f3472163.3472182&partnerID=40&md5=b53465088593b691dd5df5a55ddbb6a0
dc.subjectComputer programmingen
dc.subjectBasic conceptsen
dc.subjectBetweenness centralityen
dc.subjectEdge betweenness centralityen
dc.subjectGeodesic pathsen
dc.subjectNode betweenness centralityen
dc.subjectNode-weighted networksen
dc.subjectComputer applicationsen
dc.subjectAssociation for Computing Machineryen
dc.titleSink Group Betweenness Centralityen
dc.typeconferenceItemen


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record