1327 search results - page 119 / 266 » Path following algorithm for the graph matching problem |
114
click to vote
GD
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We present a linear-time algorithm for solving the simultaneous embedding problem with fixed edges (SEFE) for a planar graph and a pseudoforest (a graph with at most one...
123
click to vote
VLDB
2000
ACM
15 years 5 months ago
2000
ACM
Maintaining currency of search engine indices by exhaustive crawling is rapidly becoming impossible due to the increasing size and dynamic content of the web. Focused crawlers aim...
111
click to vote
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
ESA
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...