866 search results - page 31 / 174 » Algorithms for Comparing Pedigree Graphs |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Graphs provide an efficient tool for object representation in various computer vision applications. Once graph-based representations are constructed, an important question is how ...
WEA
2009
Springer
14 years 1 months ago
2009
Springer
We present initial results from the first empirical evaluation of a graph partitioning algorithm inspired by the Arora-Rao-Vazirani algorithm of [5], which combines spectral and ...
BMCBI
2008
13 years 9 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...