Combinatorial search
A generalized model for understanding evasiveness
Information Processing Letters
Optimal Reconstruction of Graphs Under the Additive Model
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Extremal Graph Theory
Optimally reconstructing weighted graphs using queries
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Toward a deterministic polynomial time algorithm with optimal additive query complexity
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Reconstructing weighted graphs with minimal query complexity
Theoretical Computer Science
Toward a deterministic polynomial time algorithm with optimal additive query complexity
Theoretical Computer Science
On parity check (0, 1)-matrix over Zp
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Combinatorial search on graphs motivated by bioinformatics applications: a brief survey
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Hi-index | 0.01 |
We consider two generic problems of combinatorial search under the additive model. The first one is the problem of reconstructing bounded-weight vectors. We establish an optimal upper bound and observe that it unifies many known results for coin-weighing problems. The developed technique provides a basis for the graph reconstruction problem. Optimal upper bound is proved for the class of k-degenerate graphs.