arXiv (All)
open access
The Value of Steiner Hubs in Two-Hop Distance Labeling
68q1790c22combinatoricscomputational-complexitydata-structures-and-algorithmsdiscrete-mathematicsf-2-2g-2-2
Two-hop distance labelings were introduced in 2002 by Cohen, Halperin, Kaplan, and Zwick with hubs of two kinds: vertices of the graph, or, in their Steiner variant, arbitrary objects carrying arbitrary real values. On no family is the value of that freedom known. We determine it on $\ell_1$ product
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
- Local Distance Antimagic Labeling of Neighborhood Balanced Colored Graphs#1388270
- Cop number of $P_k$-free graphs without a claw or a fork#1355064
- data for Pricing the Right Dimension: Distance Bands and the Value of Uniform Aviation Carbon Pricing#1390289
- Sheeting property and rigidity for stable solutions to the Allen--Cahn equation#1218234
- Signaling Entropy Label Capability and Entropy Readable Label Depth Using IS-IS#502514
Record · ID 1536915
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