Paper Info
Title
Matching Matchings
Abstract
This paper presents the first steps toward a graph comparison method based on matching matchings, or in other words, comparison of independent edge sets in graphs. The novelty of our approach is to use matchings for calculating distance of graphs in case of edge-colored graphs. This idea can be used as a preprocessing step of graph querying applications, to speed up exact and inexact graph matching methods. We introduce the notion of colored matchings and prove some properties of them in edge colored complete graphs and complete bipartite graphs in case of two colors.
Year
DOI
Venue
2013
10.1109/ECBS-EERC.2013.19
Engineering of Computer Based Systems
Keywords
DocType
Citations 
complete graph,inexact graph,preprocessing step,independent edge set,graph comparison method,edge-colored graph,Matching Matchings,complete bipartite graph
Conference
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Gábor Bacsó18511.37
Anita Keszler292.17
Zsolt Tuza31889262.52