1327 search results - page 23 / 266 » Path following algorithm for the graph matching problem |
111
click to vote
FQAS
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
STOC
2010
ACM
15 years 4 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
STOC
2007
ACM
16 years 1 days ago
2007
ACM
In the all-pairs bottleneck paths (APBP) problem (a.k.a. allpairs maximum capacity paths), one is given a directed graph with real non-negative capacities on its edges and is aske...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. In this paper we suggest the use of light for performing useful computations. Namely, we propose a special computational device which uses light rays for solving the Hami...