{
  "aliases": [
    "graph-spanner",
    "spanner-graph-theory"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nA spanner is a (usually sparse) graph whose shortest path distances approximate those in a dense graph or other metric space. Variations include geometric spanners, graphs whose vertices are points in a geometric space; tree spanners, spanning trees of a graph whose distances approximate the graph distances, and graph spanners, sparse subgraphs of a dense graph whose distances approximate the original graph's distances. A greedy spanner is a graph spanner constructed by a greedy algorithm, generally one that considers all edges from shortest to longest and keeps the ones that are needed to preserve the distance approximation.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "graph-spanner",
      "spanner-graph-theory"
    ],
    "inventory": [
      "R48YT9RKT6"
    ],
    "kind": "concept",
    "name": "Spanner",
    "sources": [
      {
        "locator": "Glossary of graph theory, section S",
        "mention": "wikipedia://en/325802#HU7W",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "V4F9Q4JCA6"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/V4F9Q4JCA6/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/V4F9Q4JCA6.md",
  "msc": null,
  "name": "Spanner",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/V4F/V4F9Q4JCA6.md",
  "status": null,
  "tag": "V4F9Q4JCA6",
  "uri": "m2://V4F9Q4JCA6",
  "url": "https://math2.tamnd.com/wiki/spanner/",
  "writing": {
    "tag": "V4F9Q4JCA6",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}