arXiv (All)
open access
$c$-Packedness versus $λ$-Low-Density in Geometric Graphs: Theory and Practice
When designing algorithms for geometric graphs, exploiting structural parameters can lead to significantly improved bounds. Two prominent parameters in this context are $c$-packedness and $λ$-low density, both of which locally restrict graph complexity. Parameterized algorithms based on these parame
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
- Approximation Algorithms for Perfect Fair-Triangle Packing#652430
- Approximation Algorithms for Perfect Fair-Triangle Packing#650977
- A counterexample to the Fang--Lin conjecture: Edge and spectral extremality diverge near a Turán graph#1132409
- Maximizing $K_r + I_r$ in graphs with fixed edge density#985570
- Exponential random graph models with soft clique constraints#818909
Record · ID 1063442
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