Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs

Guillaume Ducoffe, M. H., & Viennot, L. (2022). Diameter, Eccentricities and Distance Oracle Computations on H-Minor Free Graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

2022

DOI

10.1137/20m136551x

Link

https://doi.org/10.1137/20m136551x

Cited by

1 citation across 1 artifact.

Domain-specific

• Diameter (graph theory)
  • For example, the distinction between constitutive identity and a convenient observable transfers from A path graph with n vertices has diameter n−1 between its two endpoints. to A low-diameter communication topology limits the minimum number or weighted cost of hops between its farthest pair of nodes..

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:219e56d54da8 · see in the full table