#### DMCA

## Incremental Algorithms for Network Management and Analysis based on Closeness Centrality (1303)

Citations: | 2 - 1 self |

### Citations

532 | A faster algorithm for betweenness centrality
- Brandes
- 2001
(Show Context)
Citation Context ...tions in cities [25]. Several works which have been conducted to rapidly compute these metrics exist in the literature. The algorithm with the best asymptotic complexity to compute centrality metrics =-=[2]-=- is believed to be asymptotically optimal [15]. Research have focused on either approximation algorithms for computing centrality metrics [3, 8, 21] or on high performance computing techniques [18, 27... |

204 | Mapping networks of terrorist cells
- Krebs
(Show Context)
Citation Context ...ysis for various purposes such as structural analysis of knowledge networks [23, 26], power grid contingency analysis [14], quantifying importance in social networks [20], analysis of covert networks =-=[16]-=-, decision/action networks [5], and even for finding the best store locations in cities [25]. Several works which have been conducted to rapidly compute these metrics exist in the literature. The algo... |

86 |
Algorithm 447: Efficient algorithms for graph manipulation
- Hopcroft, Tarjan
- 1973
(Show Context)
Citation Context ...0, and RF[d] = 6. containing both u and v (see Figure 4(c)), i.e., if the intersection above is empty, we construct Π ′ from scratch and set cid = Π ′ (uv). Π can be computed in linear, O(m + n) time =-=[11]-=-. Hence, the cost of BCD maintenance is negligible compared to the cost of updating closeness centrality. Let G ′ cid = (Vcid, E ′ cid) be the biconnected component of G ′ containing uv where Vcid = {... |

83 |
The network inhibition problem
- Phillips
- 1993
(Show Context)
Citation Context ...ting the content spread, or making the network immune to adversarial attacks. Similar problems, such as finding the most cost-effective way which reduces the entity dissemination ability of a network =-=[24]-=- or finding a small set of edges whose deletion maximizes the shortestpath length [13], have been investigated in the literature. The problem recently regained a lot of attention: A generic study whic... |

54 | Fast approximation of centrality
- Eppstein, Wang
(Show Context)
Citation Context ...e best asymptotic complexity to compute centrality metrics [2] is believed to be asymptotically optimal [15]. Research have focused on either approximation algorithms for computing centrality metrics =-=[3, 8, 21]-=- or on high performance computing techniques [18, 27]. Today, it is common to find large networks, and we are always in a quest for better techniques which help us while performing centrality-based an... |

49 | Shortest-path network interdiction
- Israeli, Wood
- 2002
(Show Context)
Citation Context ...problems, such as finding the most cost-effective way which reduces the entity dissemination ability of a network [24] or finding a small set of edges whose deletion maximizes the shortestpath length =-=[13]-=-, have been investigated in the literature. The problem recently regained a lot of attention: A generic study which uses edge insertions and deletions is done by Tong et al. [28]. They use the changes... |

49 | A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
- Madduri, Ediger, et al.
(Show Context)
Citation Context ...ics [2] is believed to be asymptotically optimal [15]. Research have focused on either approximation algorithms for computing centrality metrics [3, 8, 21] or on high performance computing techniques =-=[18, 27]-=-. Today, it is common to find large networks, and we are always in a quest for better techniques which help us while performing centrality-based analysis on them. When the network topology is modified... |

33 | Direction-optimizing breadth-first search
- Beamer, Asanovic, et al.
- 2012
(Show Context)
Citation Context ... far away from s are processed. On the other hand, for the bottom-up variant, the execution time is decreasing since the number of unprocessed nodes is decreasing. Following the idea of Beamer et al. =-=[1]-=-, we hybridize the SSSPs throughout the centrality update phase in Algorithm 3. We simply compare the number of edges need to be processed for each variant and choose the cheaper one. For the case pre... |

30 | Skill characterization based on betweenness
- Şimşek, Barto
- 2009
(Show Context)
Citation Context ...as structural analysis of knowledge networks [23, 26], power grid contingency analysis [14], quantifying importance in social networks [20], analysis of covert networks [16], decision/action networks =-=[5]-=-, and even for finding the best store locations in cities [25]. Several works which have been conducted to rapidly compute these metrics exist in the literature. The algorithm with the best asymptotic... |

29 | Social networks spread rumors in sublogarithmic time
- Doerr, Fouz, et al.
- 2011
(Show Context)
Citation Context ...Many real-life networks have been repeatedly shown to possess unique characteristics such as a small diameter and a power-law degree distribution [19]. And the spread of information is extremely fast =-=[6, 7]-=-. The proposed filter exploits one of these characteristics for efficient closeness centrality updates: the distribution of shortest-path lengths. Its efficiency is based on the phenomenon shown in Fi... |

24 | Ranking of closeness centrality for large-scale social networks
- Okamoto, Chen, et al.
- 2008
(Show Context)
Citation Context ...e best asymptotic complexity to compute centrality metrics [2] is believed to be asymptotically optimal [15]. Research have focused on either approximation algorithms for computing centrality metrics =-=[3, 8, 21]-=- or on high performance computing techniques [18, 27]. Today, it is common to find large networks, and we are always in a quest for better techniques which help us while performing centrality-based an... |

20 |
A novel application of parallel betweenness centrality to power grid contingency analysis
- Jin, Huang, et al.
- 2010
(Show Context)
Citation Context ...how central a node is in a network. They have been successfully used to carry analysis for various purposes such as structural analysis of knowledge networks [23, 26], power grid contingency analysis =-=[14]-=-, quantifying importance in social networks [20], analysis of covert networks [16], decision/action networks [5], and even for finding the best store locations in cities [25]. Several works which have... |

18 |
A fast algorithm for streaming betweenness centrality
- Green, McColl, et al.
- 2012
(Show Context)
Citation Context ...ity-based analysis on them. When the network topology is modified, ensuring the correctness of the centralities is a challenging task. This problem has been studied for dynamic and streaming networks =-=[10, 17]-=-. Even for some applications involving a static network such as the contingency analysis of power grids and robustness evaluation of networks, to be prepared and take proactive measures, we need to kn... |

18 | A quick algorithm for updating betweenness centrality
- Lee, Lee, et al.
- 2012
(Show Context)
Citation Context ...ity-based analysis on them. When the network topology is modified, ensuring the correctness of the centralities is a challenging task. This problem has been studied for dynamic and streaming networks =-=[10, 17]-=-. Even for some applications involving a static network such as the contingency analysis of power grids and robustness evaluation of networks, to be prepared and take proactive measures, we need to kn... |

15 | Betweenness centrality: algorithms and lower bounds. arXiv
- Kintali
- 2008
(Show Context)
Citation Context ...e been conducted to rapidly compute these metrics exist in the literature. The algorithm with the best asymptotic complexity to compute centrality metrics [2] is believed to be asymptotically optimal =-=[15]-=-. Research have focused on either approximation algorithms for computing centrality metrics [3, 8, 21] or on high performance computing techniques [18, 27]. Today, it is common to find large networks,... |

15 | D.A.: Citing for high impact
- Shi, Leskovec, et al.
- 2010
(Show Context)
Citation Context ...uch as closeness or betweenness, quantify how central a node is in a network. They have been successfully used to carry analysis for various purposes such as structural analysis of knowledge networks =-=[23, 26]-=-, power grid contingency analysis [14], quantifying importance in social networks [20], analysis of covert networks [16], decision/action networks [5], and even for finding the best store locations in... |

15 |
Fast network centrality analysis using GPUs
- Shi, Zhang
- 2011
(Show Context)
Citation Context ...ics [2] is believed to be asymptotically optimal [15]. Research have focused on either approximation algorithms for computing centrality metrics [3, 8, 21] or on high performance computing techniques =-=[18, 27]-=-. Today, it is common to find large networks, and we are always in a quest for better techniques which help us while performing centrality-based analysis on them. When the network topology is modified... |

15 |
Street centrality and densities of retail and services
- Porta, Latora, et al.
- 2009
(Show Context)
Citation Context ...grid contingency analysis [14], quantifying importance in social networks [20], analysis of covert networks [16], decision/action networks [5], and even for finding the best store locations in cities =-=[25]-=-. Several works which have been conducted to rapidly compute these metrics exist in the literature. The algorithm with the best asymptotic complexity to compute centrality metrics [2] is believed to b... |

13 |
R.: The structure of the computer science knowledge network
- Pham, Klamma
- 2010
(Show Context)
Citation Context ...uch as closeness or betweenness, quantify how central a node is in a network. They have been successfully used to carry analysis for various purposes such as structural analysis of knowledge networks =-=[23, 26]-=-, power grid contingency analysis [14], quantifying importance in social networks [20], analysis of covert networks [16], decision/action networks [5], and even for finding the best store locations in... |

12 | R (2012) Recommendations to boost content spread in social networks
- Chaoji, Ranu, et al.
(Show Context)
Citation Context ...the leading eigenvalue to control/speed-up the dissemination process. Otherrecent works investigate edge insertions to minimize the average shortest path distance [22] or to boost the content spread =-=[4]-=-. From the centrality point of view, there exist studies which focus on maximizing the centrality of a node set [9, 12] or a single node [12] by edge insertions. In generic centrality-based network ma... |

11 |
Fast centrality approximation in modular networks
- Chan, Leung, et al.
(Show Context)
Citation Context ...e best asymptotic complexity to compute centrality metrics [2] is believed to be asymptotically optimal [15]. Research have focused on either approximation algorithms for computing centrality metrics =-=[3, 8, 21]-=- or on high performance computing techniques [18, 27]. Today, it is common to find large networks, and we are always in a quest for better techniques which help us while performing centrality-based an... |

11 | Centralities: Capturing the fuzzy notion of importance in social graphs
- Merrer, Trédan
- 2009
(Show Context)
Citation Context ...en successfully used to carry analysis for various purposes such as structural analysis of knowledge networks [23, 26], power grid contingency analysis [14], quantifying importance in social networks =-=[20]-=-, analysis of covert networks [16], decision/action networks [5], and even for finding the best store locations in cities [25]. Several works which have been conducted to rapidly compute these metrics... |

9 |
Why rumors spread so quickly in social networks
- Fouz
(Show Context)
Citation Context ...Many real-life networks have been repeatedly shown to possess unique characteristics such as a small diameter and a power-law degree distribution [19]. And the spread of information is extremely fast =-=[6, 7]-=-. The proposed filter exploits one of these characteristics for efficient closeness centrality updates: the distribution of shortest-path lengths. Its efficiency is based on the phenomenon shown in Fi... |

9 |
melting, large graphs by edge manipulation
- Gelling
- 2012
(Show Context)
Citation Context ...e shortestpath length [13], have been investigated in the literature. The problem recently regained a lot of attention: A generic study which uses edge insertions and deletions is done by Tong et al. =-=[28]-=-. They use the changes on the leading eigenvalue to control/speed-up the dissemination process. Otherrecent works investigate edge insertions to minimize the average shortest path distance [22] or to... |

7 |
Extending Centrality, in Models and Methods in Social Network Analysis
- Everett, Borgati
- 2005
(Show Context)
Citation Context ...s to minimize the average shortest path distance [22] or to boost the content spread [4]. From the centrality point of view, there exist studies which focus on maximizing the centrality of a node set =-=[9, 12]-=- or a single node [12] by edge insertions. In generic centrality-based network management problem, the desired centralities of all the nodes need to be obtained or approximated with a small set of top... |

5 | Framework for the evaluation and management of network centrality
- Ishakian, Erdös, et al.
- 2012
(Show Context)
Citation Context ...s to minimize the average shortest path distance [22] or to boost the content spread [4]. From the centrality point of view, there exist studies which focus on maximizing the centrality of a node set =-=[9, 12]-=- or a single node [12] by edge insertions. In generic centrality-based network management problem, the desired centralities of all the nodes need to be obtained or approximated with a small set of top... |

4 |
Suggesting ghost edges for a smaller world
- Papagelis, Bonchi, et al.
- 2011
(Show Context)
Citation Context ...t al. [28]. They use the changes on the leading eigenvalue to control/speed-up the dissemination process. Otherrecent works investigate edge insertions to minimize the average shortest path distance =-=[22]-=- or to boost the content spread [4]. From the centrality point of view, there exist studies which focus on maximizing the centrality of a node set [9, 12] or a single node [12] by edge insertions. In ... |

3 |
centrality and densities of retails and services in
- Porta, Latora, et al.
(Show Context)
Citation Context ...grid contingency analysis [14], quantifying importance in social networks [20], analysis of covert networks [16], decision/action networks [5], and even for finding the best store locations in cities =-=[25]-=-. Several works which have been conducted to rapidly compute these metrics exist in the literature. The algorithm with the best asymptotic complexity to compute centrality metrics [2] is believed to b... |