WS-GraphMatching: a web service tool for graph matching
Abstract
References
Index Terms
- WS-GraphMatching: a web service tool for graph matching
Recommendations
Vertex nomination via seeded graph matching
AbstractConsider two networks on overlapping, nonidentical vertex sets. Given vertices of interest (VOIs) in the first network, we seek to identify the corresponding vertices, if any exist, in the second network. While in moderately sized networks graph ...
Edge-coloring almost bipartite multigraphs
Bipartite multigraphs have chromatic index equal to the largest degree d. We consider multigraphs obtained by inserting k vertices in edges of a connected bipartite multigraph, and show that the chromatic index may increase to at most d+1. We further ...
Attributed Graph Mining and Matching: An Attempt to Define and Extract Soft Attributed Patterns
CVPR '14: Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern RecognitionGraph matching and graph mining are two typical areas in artificial intelligence. In this paper, we define the soft attributed pattern (SAP) to describe the common subgraph pattern among a set of attributed relational graphs (ARGs), considering both the ...
Comments
Information & Contributors
Information
Published In
- General Chair:
- Jimmy Huang,
- Program Chairs:
- Nick Koudas,
- Gareth Jones,
- Xindong Wu,
- Kevyn Collins-Thompson,
- Aijun An
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Demonstration
Conference
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 193Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in