493 search results - page 53 / 99 » Quantum Query Complexity of Some Graph Problems |
84
Voted
ICFP
2008
ACM
15 years 9 months ago
2008
ACM
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
135
click to vote
ALGORITHMICA
2011
14 years 4 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
We investigate a new class of geometric problems based on the idea of online error correction. Suppose one is given access to a large geometric dataset though a query mechanism; f...
100
click to vote
ICDE
1993
IEEE
15 years 1 months ago
1993
IEEE
A topic that is currently inspiring a lot of research is parallel (distributed) computation of transitive closure queries. In [lo] the disconnection set approach has been introduc...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...