Geodesic distance in planar graphs

Jérémie Bouttier, D. F., & Guitter. (2003). Geodesic distance in planar graphs.

Type

Unclassified

Intellectual base

Unclassified

Year

2003

DOI

10.1016/s0550-3213(03)00355-9

Link

https://doi.org/10.1016/s0550-3213(03)00355-9

Cited by

1 citation across 1 artifact.

Domain-specific

• Distance (graph theory)
  • Undirected distance is a metric within a connected component, while directed distance is generally asymmetric and weighted graphs require edge-length rather than edge-count convention.

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:beaebeefef7b · see in the full table