Reconstructing weighted graphs with minimal query complexity
From MaRDI portal
Publication:2431425
DOI10.1016/j.tcs.2010.12.055zbMath1209.68267MaRDI QIDQ2431425
Hanna Mazzawi, Nader H. Bshouty
Publication date: 14 April 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.055
92D20: Protein sequences, DNA sequences
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)
05C22: Signed and weighted graphs
Related Items
Unnamed Item, Signature codes for noisy multiple access adder channel, Network verification via routing table queries, Reconstruction and verification of chordal graphs with a distance oracle, Exact learning from an honest teacher that answers membership queries
Cites Work