Publication:5302100
From MaRDI portal
zbMath1231.68150MaRDI QIDQ5302100
Publication date: 5 January 2009
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
68W25: Approximation algorithms
Related Items
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness, On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$, Toward a deterministic polynomial time algorithm with optimal additive query complexity, Optimal query complexity bounds for finding graphs, Reconstructing weighted graphs with minimal query complexity, Topology discovery of sparse random graphs with few participants, Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries, Reconstructing Weighted Graphs with Minimal Query Complexity