Paper Info
Title
WS-GraphMatching: a web service tool for graph matching
Abstract
Some emerging applications deal with graph data and relie on graph matching and mining. The service-oriented graph matching and mining tool has been required. In this demo we present the web service tool WS-GraphMatching which supports the efficient and visualized matching of polytrees, series-parallel graphs, and arbitrary graphs with bounded feedback vertex set. Its embedded matching algorithms take in account the similarity of vertex-to-vertex and graph structures, allowing path contraction, vertex deletion, and vertex insertions. It provides one-to-one matching queries as well as queries in batch modes including one-to-many matching mode and many-to-many matching mode. It can be used for predicting unknown structured information, comparing and finding conserved patterns, and resolving ambiguous identification of vertices. WS-GraphAligner is available as web-server at: http://odysseus.cs.fiu.edu:8080/MinePW/pages/gmapping/GMMain.html.
Year
DOI
Venue
2010
10.1145/1871437.1871779
CIKM
Keywords
Field
DocType
graph structure,many-to-many matching mode,service-oriented graph matching,series-parallel graph,visualized matching,one-to-many matching mode,web service tool,arbitrary graph,graph data,graph matching,embedded matching algorithm,web service,feedback vertex set
Line graph,Vertex (graph theory),Graph factorization,Computer science,Bipartite graph,Theoretical computer science,Matching (graph theory),Factor-critical graph,3-dimensional matching,Feedback vertex set
Conference
Citations 
PageRank 
References 
0
0.34
2
Authors
4
Name
Order
Citations
PageRank
Qiong Cheng100.34
Mitsunori Ogihara23135257.04
Jinpeng Wei322120.22
Alexander Zelikovsky41691244.62