arXiv (All)
open access
A Sublinear Approximation Algorithm for Minimum Dilation Trees in the Plane
The dilation of a geometric graph measures how much longer the path between pairs of points becomes when restricted to graph edges, rather than following the direct path through the ambient space. The minimum dilation tree of a point set is the spanning tree with minimum dilation, where edge lengths
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Visualizing Treewidth#798636
- Visualizing Treewidth#797223
- Minimum spanning tree vs Shortest path#796567
- Towards Faithful Graph Explanations with Synergistic Edge Effects via Granular Balls#394464
- Embedding rooted blow-ups of tree posets#1049282
Record · ID 986603
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive