Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

30

CJ
2002

favoriteEmaildiscussreport

61views more CJ 2002»

RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

13 years 10 months ago

RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs

Download iasl.iis.sinica.edu.tw

John W. Raymond, Eleanor J. Gardiner, Peter Willet

Real-time Traffic

CJ 2002 |

claim paper

Related Content

» Similarity Analysis of Protein Binding Sites A Generalization of the Maximum Common Subgra...

» Challenging Complexity of Maximum Common Subgraph Detection Algorithms A Performance Analy...

» Learning to rank graphs for online similar graph search

» Online Structural Graph Clustering Using Frequent Subgraph Mining

» 3D Shape Matching Using Skeleton Graphs

» Common visual pattern discovery via spatially coherent correspondences

» Bipartite Ramsey numbers and Zarankiewicz numbers

» Mining protein family specific residue packing patterns from protein structure graphs

» Improving pairwise sequence alignment accuracy using nearoptimal protein sequence alignmen...

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2002
Where	CJ
Authors	John W. Raymond, Eleanor J. Gardiner, Peter Willett 0002

Comments (0)