56 search results - page 7 / 12 » The RW2 Algorithm for Exact Graph Matching |
120
click to vote
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Given a graph database D and a query graph g, an exact subgraph matching query asks for the set S of graphs in D that contain g as a subgraph. This type of queries find important...
SIROCCO
2010
15 years 1 months ago
2010
The problem of grooming is central in studies of optical networks. In graph-theoretic terms, it can be viewed as assigning colors to given paths in a graph, so that at most g (the ...
100
click to vote
DGCI
2009
Springer
15 years 2 months ago
2009
Springer
Finding an efficient optimal partial tiling algorithm is still an open problem. We have worked on a special case, the tiling of Manhattan polyominoes with dominoes, for which we gi...
132
Voted
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
Given a graph G = (V, E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . ,...
108
click to vote
MP
2010
14 years 6 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...