ISTA Publications
metadata only
Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension graphs in truly subquadratic time
We present the first truly subquadratic time algorithm to compute diameter and eccentricities in real-weighted directed graphs with constant distance VC-dimension and strongly sublinear-sized balanced separators. For real-weighted K_h-minor-free digraphs, this runs in O(n^{2-1/(2h-2)} polylog(n)) ti
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
- Six-Vertex, Loop and Tiling models: Integrability and Combinatorics#972829
- Scalable Size- and Shape-Selective Purification of Colloidal Building Blocks via Excluded Volume Interactions#677727
- Scalable Size- and Shape-Selective Purification of Colloidal Building Blocks via Excluded Volume Interactions#674524
- How well is surface ocean carbon represented in observations and ocean models?#819603
- How well is surface ocean carbon represented in observations and ocean models?#809607
Record · ID 1146753
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