The Power of Quasi-Shortest Paths: Ρ-Geodesic Betweenness Centrality

IEEE Transactions on Network Science and Engineering - United States
doi 10.1109/tnse.2017.2708705
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Stochastic Shortest Paths via Quasi-Convex Maximization

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
1999English

Figure S2: Node Betweenness Centrality (BwC) of Each Phylum

English

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Shortest Gently Descending Paths

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

An Approximate Flow Betweenness Centrality Measure for Complex Network

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2013English

Physarum Can Compute Shortest Paths

2012English

Implementing Parallel Shortest-Paths Algorithms

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1997English

Shortest-Paths Preserving Metro Maps

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy