Matching matchings

Gábor Bacsó, Anita Keszler, Z. Tuza

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013
PublisherIEEE Computer Society
Pages85-94
Number of pages10
ISBN (Print)9780769550640
DOIs
Publication statusPublished - 2013
Event2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013 - Budapest, Hungary
Duration: Aug 29 2013Aug 30 2013

Other

Other2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013
CountryHungary
CityBudapest
Period8/29/138/30/13

Fingerprint

Color

Keywords

  • colored matching
  • edge-colored graph
  • inexact graph matching

ASJC Scopus subject areas

  • Information Systems

Cite this

Bacsó, G., Keszler, A., & Tuza, Z. (2013). Matching matchings. In Proceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013 (pp. 85-94). [6664514] IEEE Computer Society. https://doi.org/10.1109/ECBS-EERC.2013.19

Matching matchings. / Bacsó, Gábor; Keszler, Anita; Tuza, Z.

Proceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013. IEEE Computer Society, 2013. p. 85-94 6664514.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bacsó, G, Keszler, A & Tuza, Z 2013, Matching matchings. in Proceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013., 6664514, IEEE Computer Society, pp. 85-94, 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013, Budapest, Hungary, 8/29/13. https://doi.org/10.1109/ECBS-EERC.2013.19
Bacsó G, Keszler A, Tuza Z. Matching matchings. In Proceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013. IEEE Computer Society. 2013. p. 85-94. 6664514 https://doi.org/10.1109/ECBS-EERC.2013.19
Bacsó, Gábor ; Keszler, Anita ; Tuza, Z. / Matching matchings. Proceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013. IEEE Computer Society, 2013. pp. 85-94
@inproceedings{f009de7d5653498197629f2c351858a1,
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.",
keywords = "colored matching, edge-colored graph, inexact graph matching",
author = "G{\'a}bor Bacs{\'o} and Anita Keszler and Z. Tuza",
year = "2013",
doi = "10.1109/ECBS-EERC.2013.19",
language = "English",
isbn = "9780769550640",
pages = "85--94",
booktitle = "Proceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Matching matchings

AU - Bacsó, Gábor

AU - Keszler, Anita

AU - Tuza, Z.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - colored matching

KW - edge-colored graph

KW - inexact graph matching

UR - http://www.scopus.com/inward/record.url?scp=84892543636&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84892543636&partnerID=8YFLogxK

U2 - 10.1109/ECBS-EERC.2013.19

DO - 10.1109/ECBS-EERC.2013.19

M3 - Conference contribution

AN - SCOPUS:84892543636

SN - 9780769550640

SP - 85

EP - 94

BT - Proceedings - 2013 IEEE 3rd Eastern European Regional Conference on the Engineering of Computer Based Systems, ECBS-EERC 2013

PB - IEEE Computer Society

ER -