1132 search results - page 39 / 227 » Similarity Graphs |
GCB
2009
Springer
14 years 2 months ago
2009
Springer
Abstract: Graphs are often used to describe and analyze the geometry and physicochemical composition of biomolecular structures, such as chemical compounds and protein active sites...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
CORR
2007
Springer
13 years 11 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
AAAI
2006
14 years 11 days ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
JCP
2008
13 years 11 months ago
2008
Existing frequent subgraph mining algorithms can operate efficiently on graphs that are sparse, have vertices with low and bounded degrees, and contain welllabeled vertices and edg...