Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Dianne S. V. de Medeiros
The Power of Quasi-Shortest Paths: Ρ-Geodesic Betweenness Centrality
IEEE Transactions on Network Science and Engineering
Control
Computer Networks
Computer Science Applications
Systems Engineering
Communications
Related publications
Stochastic Shortest Paths via Quasi-Convex Maximization
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximate Shortest Paths and Geodesic Diameter on a Convex Polytope in Three Dimensions
Discrete and Computational Geometry
Combinatorics
Mathematics
Geometry
Discrete Mathematics
Computational Theory
Topology
Theoretical Computer Science
Figure S2: Node Betweenness Centrality (BwC) of Each Phylum
All Pairs Shortest Paths
An Elementary Approach to Design and Analysis of Algorithms
Shortest Gently Descending Paths
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Approximate Flow Betweenness Centrality Measure for Complex Network
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
Physarum Can Compute Shortest Paths
Implementing Parallel Shortest-Paths Algorithms
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Shortest-Paths Preserving Metro Maps
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
