Quantum Query Complexity of Some Graph Problems - Dürr, Christoph; Heiligman, Mark; HOyer, Peter; Mhalla, Mehdi (SIAM journal on computing, 2006)
Keywords: Algorithmics. Computability. Computer arithmetics; Algorithms; Applied sciences; Arrays; Combinatorics; Combinatorics. Ordered structures; Computer Science; Computer science; control theory; systems; Connectivity; Exact sciences and technology; Graph theory; Graphs; Information retrieval. Graph; Mathematics; Queries; R&D; Research & development; Sciences and techniques of general use; Theoretical computing; 68W20; Lower bound; Quantum algorithm; Error estimation; 05C85; minimum spanning tree; Shortest path; Adjacency matrix; Graph theory; Complexity; Upper bound; 81-04; connectivity; Graph connectivity; Spanning tree; 68R10; single source shortest paths