{"title":"匹配的匹配","authors":"G. Bacsó, Anita Keszler, Z. Tuza","doi":"10.1109/ECBS-EERC.2013.19","DOIUrl":null,"url":null,"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.","PeriodicalId":314029,"journal":{"name":"2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2013-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Matching Matchings\",\"authors\":\"G. Bacsó, Anita Keszler, Z. Tuza\",\"doi\":\"10.1109/ECBS-EERC.2013.19\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":314029,\"journal\":{\"name\":\"2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-08-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECBS-EERC.2013.19\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECBS-EERC.2013.19","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
