arXiv (All)
open access
Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size
Network microaggregation is a fundamental technique in statistical disclosure control, where vertices of a graph are partitioned into clusters satisfying size constraints and admitting a center within bounded distance. We study the parameterized complexity of the \emph{unweighted Connected Network M
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
- Parameterized Complexity of Connected Network Microaggregation: The Role of Cluster Size#789149
- Impact of seed node position on network robustness under localized attacks#1062840
- An $m+n^{3/2}$ algorithm for counting spanning trees by $\ell_1$-regularized resistance#1084366
- Non-uniform content-oblivious leader election in 2-edge-connected networks#1079290
- Power of edge exclusion tests in graphical gaussian models#1169072
Record · ID 793153
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