{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreicjwbt4i3l6trpxv6cxcdeiylscz226pwlqblesowi7jgjdak2efu",
    "uri": "at://did:plc:3fychdutjjusoqeq24ljch6q/app.bsky.feed.post/3mhu7qgahkxt2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.22948v1",
  "publishedAt": "2026-03-25T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Joachim Gudmundsson",
    "Yuan Sha",
    "Sampson Wong"
  ],
  "textContent": "**Authors:** Joachim Gudmundsson, Yuan Sha, Sampson Wong\n\nIn the celebrated paper of Henzinger, Klein, Rao and Subramanian (1997), it was shown that planar graphs admit a linear time single-source shortest path algorithm. Their algorithm unfortunately does not extend to Euclidean graph classes. We give criteria and prove that any Euclidean graph class satisfying the criteria admits a linear time single-source shortest path algorithm. As a main ingredient, we show that the contracted graphs of these Euclidean graph classes admit sublinear separators.",
  "title": "Linear time single-source shortest path algorithms in Euclidean graph classes"
}