匹配的匹配

2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems Pub Date : 2013-08-29 DOI:10.1109/ECBS-EERC.2013.19

G. Bacsó, Anita Keszler, Z. Tuza

{"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}

引用次数: 0

摘要

本文介绍了基于匹配匹配的图比较方法的第一步，或者换句话说，图中独立边集的比较。该方法的新颖之处在于在边缘彩色图的情况下使用匹配来计算图的距离。该思想可以作为图形查询应用程序的预处理步骤，以加快精确和不精确的图形匹配方法。引入了彩色匹配的概念，并在两种颜色的边缘彩色完全图和完全二部图中证明了彩色匹配的一些性质。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Matching Matchings

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2013 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems

自引率

0.00%

发文量