1951 search results - page 130 / 391 » An algorithm for improving graph partitions |
156
click to vote
ECCC
2010
15 years 1 months ago
2010
We consider the reachability problem for a certain class of directed acyclic graphs embedded on surfaces. Let G(m, g) be the class of directed acyclic graphs with m = m(n) source ...
229
click to vote
SIGMOD
2007
ACM
16 years 4 months ago
2007
ACM
Query processing over graph-structured data is enjoying a growing number of applications. Keyword search on a graph finds a set of answers, each of which is a substructure of the ...
128
click to vote
IROS
2009
IEEE
15 years 11 months ago
2009
IEEE
— In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism...
145
click to vote
GBRPR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Graph matching is often used for image recognition. Different kinds of graph matchings have been proposed such as (sub)graph isomorphism or error-tolerant graph matching...
169
Voted
CORR
2012
Springer
14 years 8 days ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...