A faster algorithm for betweenness centrality*
From MaRDI portal
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- Optimal attack strategy of complex networks based on tabu search
- From the grid to the smart grid, topologically
- Combining fuzzy logic and eigenvector centrality measure in social network analysis
- Reachability for airline networks: fast algorithm for shortest path problem with time windows
- On analyzing user preference dynamics with temporal social networks
- Ranking the spreading influence of nodes in complex networks: an extended weighted degree centrality based on a remaining minimum degree decomposition
- A new pinning control scheme of complex networks based on data flow
- Systematic evaluation of a new combinatorial curvature for complex networks
- A new evidential methodology of identifying influential nodes in complex networks
- Scalable computational techniques for centrality metrics on temporally detailed social network
- Loss of conservation of graph centralities in reverse-engineered transcriptional regulatory networks
- High-order degree and combined degree in complex networks
- New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks
- Computing the eccentricity distribution of large graphs
- Fast approximation of betweenness centrality through sampling
- The critical node detection problem in networks: a survey
- Efficient algorithms for updating betweenness centrality in fully dynamic graphs
- Ranking the spreading ability of nodes in complex networks based on local structure
- Damage attack on complex networks
- Global disease spread: statistics and estimation of arrival times
- A new measure of identifying influential nodes: efficiency centrality
- Energy disruptive centrality with an application to criminal network
- Intrinsic approaches to prioritizing diagnoses in multi-context systems
- Role detection and prediction in dynamic political networks
- Learning centrality by learning to route
- Percolation centrality via Rademacher Complexity
- Incorporating auxiliary information in betweenness measure for input-output networks
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint
- The parallel computing of node centrality based on GPU
- A new method for quantifying network cyclic structure to improve community detection
- Identifying influential nodes in complex networks based on AHP
- The use of nodes attributes in social network analysis with an application to an international trade network
- Compressive sensing of high betweenness centrality nodes in networks
- Algorithm for determining the mutual impact of nodes in weighted directed graphs
- Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks
- A new method for centrality measurement using generalized fuzzy graphs
- Physics-informed machine learning for backbone identification in discrete fracture networks
- A centrality measure in dense networks based on two-way random walk betweenness
- Optimizing node infiltrations in complex networks by a local search based heuristic
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
- A polynomial-time algorithm for finding critical nodes in bipartite permutation graphs
- Group centralization of network indices
- Computational processes that appear to model human memory
- Exploring networks with traceroute-like probes: Theory and simulations
- On bounds for the cutting number of a graph
- Complex networks: structure and dynamics
- Network analysis and systemic FX settlement risk
- Human dopamine receptors interaction network (DRIN): a systems biology perspective on topology, stability and functionality of the network
- A lower bound for algebraic connectivity based on the connection-graph-stability method
- Graph ambiguity
- Heuristical top-\(k\): fast estimation of centralities in complex networks
- Algebraic structures for dynamic networks
- Analyzing the maritime transportation system in Greece: a complex network approach
- Centrality analysis in a drug network and its application to drug repositioning
- Random networks are heterogeneous exhibiting a multi-scaling law
- Downstream protection value: detecting critical zones for effective fuel-treatment under wildfire risk
- Novel centrality measures and applications to underground networks
- Towards classifying the polynomial-time solvability of temporal betweenness centrality
- Vector centrality in hypergraphs
- Hybrid constructive heuristics for the critical node problem
- A new betweenness centrality measure based on an algorithm for ranking the nodes of a network
- The role of nonlinearity in computing graph-theoretical properties of resting-state functional magnetic resonance imaging brain networks
- Localized bridging centrality
- A Faster Algorithm to Update Betweenness Centrality after Node Alteration
- A comprehensive reachability evaluation for airline networks with multi-constraints
- COMPLEX NETWORK TOOLS TO ENABLE IDENTIFICATION OF A CRIMINAL COMMUNITY
- Cascading failures in congested scale-free networks
- Maximum betweenness centrality: approximability and tractable cases
- Efficient computation of time-dependent centralities in air transportation networks
- Large-scale network analysis
- Analysis of complex network performance and heuristic node removal strategies
- Spreading dynamics in complex networks
- Analyzing complex networks through correlations in centrality measurements
- Minimal paths between communities induced by geographical networks
- Fully-dynamic approximation of betweenness centrality
- FAST COMMUNITY IDENTIFICATION BY HIERARCHICAL GROWTH
- EXISTENCE, COST AND ROBUSTNESS OF SPATIAL SMALL-WORLD NETWORKS
- EIGENMODE OF THE DECISION-BY-MAJORITY PROCESS IN COMPLEX NETWORKS
- EXTENDED FIBER BUNDLE MODEL FOR TRAFFIC JAMS ON SCALE-FREE NETWORKS
- LOAD DISTRIBUTION IN CONGESTED SCALE-FREE NETWORKS
- Mixing local and global information for community detection in large networks
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks
- Some results on approximate 1-median selection in metric spaces
- Computing Critical Nodes in Directed Graphs
- Improving the betweenness centrality of a node by adding links
- Dynamic merging of frontiers for accelerating the evaluation of betweenness centrality
- The vertex attack tolerance of complex networks
- scientific article; zbMATH DE number 6917138 (Why is no real title available?)
- Graph clustering
- Faster computation of successive bounds on the group betweenness centrality
- Detection of core-periphery structure in networks using spectral methods and geodesic paths
- KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
- InfoSearch: a social search engine
- Truly subcubic algorithms for language edit distance and RNA folding via fast bounded-difference min-plus product
- MEASURING OPTIMAL CONNECTIONS IN LARGE NETWORKS: A NEW ALGORITHM AND ITS APPLICATIONS
- Improvement of path analysis algorithm in social networks based on HBase
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- A faster algorithm to update betweenness centrality after node alteration
- Algebraic algorithms for betweenness and percolation centrality
- Exact and approximate algorithms for computing betweenness centrality in directed graphs
This page was built for publication: A faster algorithm for betweenness centrality*
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2765440)
