Main

Mint Work Search Explore Works Knowledge Graph Citation Graph Bibliometrics Receipts

v1

A Simple Yet Effective Algorithm to Compute Incremental All-Pairs Shortest Distances

Identifier:nobleid.org/w1/20260515/36AF72BD

Type:Journal Article

0 views

Support unavailableClaim Your Authorship

View Original Paper Source

Embeddable Badge

[![NobleID](https://www.nobleid.org/api/badge/36AF72BD.svg?ark=w1%2F20260515%2F36AF72BD)](https://nobleid.org/work/w1/20260515/36AF72BD)

ARK Inflections

Metadata Policy

Metadata Formats

Bibliometric Analysis

Impact metrics, research fronts, co-authorship networks →

Authors & Claims

Paper Authors

Néstor Rodríguez

Sergio Rojas–Galeano

Claim authorship of this work

info@nobleid.org

About FAQ Terms Policy Persistence & Resolver Service Policy

A Simple Yet Effective Algorithm to Compute Incremental All-Pairs Shortest Distances | NobleID