1402 search results - page 143 / 281 » Searching Cycle-Disjoint Graphs |
148
Voted
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
Many parameterized algorithms for NP-hard graph problems are search tree algorithms with sophisticated local branching rules. But it has also been noticed that the global structur...
112
click to vote
OOPSLA
2005
Springer
15 years 10 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
142
click to vote
ICPR
2000
IEEE
15 years 9 months ago
2000
IEEE
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
169
click to vote
WWW
2008
ACM
16 years 5 months ago
2008
ACM
Improving the precision of information retrieval has been a challenging issue on Chinese Web. As exemplified by Chinese recipes on the Web, it is not easy/natural for people to us...
142
click to vote
DATE
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...