arXiv (All)
open access
Multi-tier Flexible Graph Connectivity
Motivated by non-uniform edge failures in network design, we introduce a multi-tier model of flexible graph connectivity. In k-tier Flexible Graph Connectivity (k-tier FGC), the input is an undirected graph G=(V, E) with non-negative edge costs, along with a classification of the edges into nested t
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
- Multi-tier Flexible Graph Connectivity#788326
- MidSurfNet: Learning Face Pairing for Mid-surface Abstraction of Thin-walled CAD Models#926059
- The extremal cases of the Erd\H os--Sós conjecture#985286
- Explicit Fractalizers: Prime-Order Paley Graphs and other Cayley Graphs#1118238
- Exact benchmarks for the plasmon-pole approximation: Multi-scale screening and the breakdown of the quasiparticle picture#1077563
Record · ID 792326
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