1056 search results - page 199 / 212 » Constraint-Based Graph Matching |
137
Voted
BIBE
2006
IEEE
15 years 8 months ago
2006
IEEE
Discerning the similarity between two molecules is a challenging problem in drug discovery as well as in molecular biology. The importance of this problem is due to the fact that ...
119
Voted
PODC
2005
ACM
15 years 8 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
126
Voted
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex c...
133
Voted
CC
2009
Springer
15 years 7 months ago
2009
Springer
Single-assignment languages with copy semantics have a very simple and approachable programming model. A na¨ıve implementation of the copy semantics that copies the result of eve...
127
Voted
SPAA
1990
ACM
15 years 6 months ago
1990
ACM
Fractional cascading is a technique designed to allow e cient sequential search in a graph with catalogs of total size n. The search consists of locating a key in the catalogs alo...