Quantum Query Complexity of Some Graph Problems

Christoph Dürr, Mark Heiligman, Peter Høyer, Mehdi Mhalla. Quantum Query Complexity of Some Graph Problems. SIAM Journal on Computing, 35(6):1310-1328, 2006. [doi]

@article{DurrHHM06,
  title = {Quantum Query Complexity of Some Graph Problems},
  author = {Christoph Dürr and Mark Heiligman and Peter Høyer and Mehdi Mhalla},
  year = {2006},
  doi = {10.1137/050644719},
  url = {http://dx.doi.org/10.1137/050644719},
  tags = {graph query, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/DurrHHM06},
  cites = {0},
  citedby = {0},
  journal = {SIAM Journal on Computing},
  volume = {35},
  number = {6},
  pages = {1310-1328},
}