STACS 2005

DOI10.1007/B106485MaRDI QIDQ5710705zbMATH OpenOpenAlexFDO

Authors Ulrik Brandes, Daniel Fleischer

Publication date 2 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106485

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• Alpha current flow betweenness centrality
• Network Analysis
• Approximating Betweenness Centrality
• Better approximation of betweenness centrality
• Fast Approximation of Centrality

Cited in

(40)

• On decay centrality
• A measure for a balanced workload and its extremal values
• Alpha current flow betweenness centrality
• Network Analysis
• Routing betweenness centrality
• A variant of the current flow betweenness centrality and its application in urban networks
• Ranking edges by their impact on the spectral complexity of information diffusion over networks
• Analyzing complex networks through correlations in centrality measurements
• Polynomial-time algorithms for submodular Laplacian systems
• Computing top-\(k\) closeness centrality faster in unweighted graphs
• Effective graph classification based on topological and label attributes
• Axiomatic characterization of PageRank
• Resistance distances in directed graphs: definitions, properties, and applications
• Machine learning for graph-based representations of three-dimensional discrete fracture networks
• Generalized network measures based on modulus of families of walks
• Network Analysis
• Betweenness centrality in Cartesian product of graphs
• A new measure of identifying influential nodes: efficiency centrality
• Fast approximation of centrality
• Sparse randomized shortest paths routing with Tsallis divergence regularization
• Central Positions in Social Networks
• Generalization of effective conductance centrality for egonetworks
• Modified Myerson value for determining the centrality of graph vertices
• Measuring the flow of information among cities using the diffusion power
• Fast Approximation of Centrality
• Structural evaluation for distribution networks with distributed generation based on complex network
• A modified Myerson value for determining the centrality of graph vertices
• Centrality measure in graphs
• Disjoint multipath closeness centrality
• An Edge Centrality Measure Based on the Kemeny Constant
• Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis
• Resistance-distance betweenness: definition, properties, and application in complex linguistic networks
• A survey on optimization studies of group centrality metrics
• Diffusion and targeting centrality
• Randomized shortest paths with net flows and capacity constraints
• A centrality measure in dense networks based on two-way random walk betweenness
• Centrality
• Estimating current-flow closeness centrality with a multigrid Laplacian solver
• SOME CENTRALITY RESULTS NEW AND OLD
• Subcubic equivalences between graph centrality problems, APSP and diameter

This page was built for publication: STACS 2005

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5710705)