STACS 2005

DOI10.1007/b106485zbMath1118.90302OpenAlexW4230940848MaRDI QIDQ5710705

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

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

Related Items (22)

Randomized shortest paths with net flows and capacity constraints ⋮ Central Positions in Social Networks ⋮ Generalized network measures based on modulus of families of walks ⋮ Betweenness centrality in Cartesian product of graphs ⋮ A modified Myerson value for determining the centrality of graph vertices ⋮ Unnamed Item ⋮ Structural evaluation for distribution networks with distributed generation based on complex network ⋮ Disjoint multipath closeness centrality ⋮ Resistance-distance betweenness: definition, properties, and application in complex linguistic networks ⋮ An Edge Centrality Measure Based on the Kemeny Constant ⋮ Axiomatic characterization of PageRank ⋮ A measure for a balanced workload and its extremal values ⋮ Machine learning for graph-based representations of three-dimensional discrete fracture networks ⋮ Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis ⋮ Analyzing complex networks through correlations in centrality measurements ⋮ Polynomial-time algorithms for submodular Laplacian systems ⋮ A centrality measure in dense networks based on two-way random walk betweenness ⋮ A new measure of identifying influential nodes: efficiency centrality ⋮ A variant of the current flow betweenness centrality and its application in urban networks ⋮ Centrality measure in graphs ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ Effective graph classification based on topological and label attributes

This page was built for publication: STACS 2005