arXiv (All)
open access
Random-Priority Frontier Routing: Tight $Θ(n^c)$ Bounds Against $c$-Node Cartels
We study path diversification in trusted-node networks, where sensitive material is relayed through intermediate nodes, some of which may be compromised. Our randomized routing rule assigns each vertex an independent random priority and repeatedly expands the highest-priority vertex on the global fr
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
- Locally Sparsified, Globally Near-Optimal: Matching under Independent Vertex Arrivals#1063372
- Evolving scale-free networks and node-based random edge deletion#1117328
- First-Passage Percolation on Spread-out line graphs: Microscopic Regime#821967
- Intersections of Directed Graphs#1050273
- Deterministic Networking (DetNet): Packet Ordering Function#134708
Record · ID 820895
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