On Computational Complexity of Graph Inference from Counting

Reference:

S. Z. Fazekas, H. Ito, Y. Okuno, S. Seki, and K. Taneishi. On computational complexity of graph inference from counting. Natural Computing, 2012. DOI:10.1007/s11047-012-9349-2.

Suggested BibTeX entry:

@article{FaItOkSeTa2012,
    author = {S. Z. Fazekas and H. Ito and Y. Okuno and S. Seki and K. Taneishi},
    journal = {Natural Computing},
    language = {eng},
    note = {DOI:10.1007/s11047-012-9349-2},
    title = {On Computational Complexity of Graph Inference from Counting},
    year = {2012},
}