Graph Matching Based on Similarities in Structure and Attributes
Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based on graphs connectivities has attracted considerable attention, while the integration of all the other information stemming from vertices and e...
Uloženo v:
| Vydáno v: | Journal of graph algorithms and applications Ročník 29; číslo 1; s. 289 - 320 |
|---|---|
| Hlavní autor: | |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
15.11.2025
|
| ISSN: | 1526-1719, 1526-1719 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based on graphs connectivities has attracted considerable attention, while the integration of all the other information stemming from vertices and edges attributes has been mostly left aside. Here we present the Graph Attributes and Structure Matching (GASM) algorithm, which provides high-quality solutions by integrating all the available information in a unified framework. Parameters quantifying the reliability of the attributes can tune how much the solutions should rely on the structure or on the attributes. We further show that even without attributes GASM consistently finds as-good-as or better solutions than state-of-the-art algorithms, with similar processing times. |
|---|---|
| AbstractList | Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based on graphs connectivities has attracted considerable attention, while the integration of all the other information stemming from vertices and edges attributes has been mostly left aside. Here we present the Graph Attributes and Structure Matching (GASM) algorithm, which provides high-quality solutions by integrating all the available information in a unified framework. Parameters quantifying the reliability of the attributes can tune how much the solutions should rely on the structure or on the attributes. We further show that even without attributes GASM consistently finds as-good-as or better solutions than state-of-the-art algorithms, with similar processing times. |
| Author | Candelier, Raphaël |
| Author_xml | – sequence: 1 givenname: Raphaël orcidid: 0000-0002-1523-6249 surname: Candelier fullname: Candelier, Raphaël |
| BookMark | eNpNz71OwzAUBWALFYm2MLP6BZL63vw43igVFKQiBrpH17HTumqTynaQeHtIYWA65yxH-mZs0vWdZeweRCqhKBaHHVH6icpBikqqKzaFAssEJKjJv37DZiEchMAMZTVlD2tP5z1_o9jsXbfjjxSs4X3HP9zJHcm76Gzg7mdHPzRx8JZTZ_gyRu_0EG24ZdctHYO9-8s52z4_bVcvyeZ9_bpabpKmApWgkCbHtjCEBIgKS63LVsocUJGptDJWyFwb25gKSoLGEpAuALVUWivK5mzxe9v4PgRv2_rs3Yn8Vw2iHv316K8v_nr0Z98LtlHn |
| ContentType | Journal Article |
| DBID | AAYXX CITATION |
| DOI | 10.7155/jgaa.v29i1.2979 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1526-1719 |
| EndPage | 320 |
| ExternalDocumentID | 10_7155_jgaa_v29i1_2979 |
| GroupedDBID | -~9 29K 2WC 5GY AAFWJ AAKPC AAYXX ACGFO ACIPV AFPKN ALMA_UNASSIGNED_HOLDINGS CITATION D-I E3Z EBS EJD F5P GROUPED_DOAJ M~E OK1 OVT P2P REM RNS TR2 XSB |
| ID | FETCH-LOGICAL-c819-207d42f5da2a122926bb6f774129ad8b9de074bdecd816a1cea1ab512b79bb9a3 |
| ISSN | 1526-1719 |
| IngestDate | Thu Nov 20 00:47:48 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c819-207d42f5da2a122926bb6f774129ad8b9de074bdecd816a1cea1ab512b79bb9a3 |
| ORCID | 0000-0002-1523-6249 |
| OpenAccessLink | https://jgaa.info/index.php/jgaa/article/download/2979/3016 |
| PageCount | 32 |
| ParticipantIDs | crossref_primary_10_7155_jgaa_v29i1_2979 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-11-15 |
| PublicationDateYYYYMMDD | 2025-11-15 |
| PublicationDate_xml | – month: 11 year: 2025 text: 2025-11-15 day: 15 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of graph algorithms and applications |
| PublicationYear | 2025 |
| SSID | ssj0023278 |
| Score | 2.3711233 |
| Snippet | Finding vertex-to-vertex correspondences in real-world graphs is a challenging task with applications in a wide variety of domains. Structural matching based... |
| SourceID | crossref |
| SourceType | Index Database |
| StartPage | 289 |
| Title | Graph Matching Based on Similarities in Structure and Attributes |
| Volume | 29 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1526-1719 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023278 issn: 1526-1719 databaseCode: DOA dateStart: 20030101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1526-1719 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0023278 issn: 1526-1719 databaseCode: M~E dateStart: 19970101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV07T8MwELagMMCAeIq3PDAgoUDj0ji38RCPpQiJDmzROXZKpDZFtKo68ds5O49GPCQYWKzWak9xPuvuu4fPjB0FCdk5vxV7tJekd64w9hDI5wlEEyEJFXld6C6bkA8P4fMzPBZF7CN3nYDMsnA6hdd_hZrmCGx7dPYPcFdCaYI-E-g0Euw0_gr4O9uC-qRDKtYFl67ITGmbEnhKBym5sa6Dqo1yPLnOsWX-4HKcX31VlBR-pauus_UJ9ntDEvEyyFs719Pfs2xGpg0x27xwm_6ELhl_1a8HGETbnrTLj1iWOlEEni8LzWa-mSsUaRG6qG-YQiuGUDOwLXf67YvulsRsrO7uIZ5OBKTkvIOEmZkqU_OfrFdVU0jejBURWQGRExBZAfNsQcg22Gq_zvtN5Yu3hDPS1Tryrk9WwNmnJ6gRlhrz6K6ylQIDfplDvcbmTLbOljtVv93RBrtwoPMSdO5A58OM10HnKX0vQeeEEp-Bvsm6tzfd63uvuBvDi4nD0YaX-lwkbY0CfSFABEoFCVF5om-oQwXaEDdU2sQ69AP0Y4M-KiJ3SoJSgK0t1siGmdlmXDTBeu2gE5kQU4nRCNAKDKIiO95Odthxuf7oNe-AEv3wrnd__9M9tjTba_usQas3B2wxnozT0duhi4wcOsQ-AOCXVrw |
| linkProvider | ISSN International Centre |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Graph+Matching+Based+on+Similarities+in+Structure+and+Attributes&rft.jtitle=Journal+of+graph+algorithms+and+applications&rft.au=Candelier%2C+Rapha%C3%ABl&rft.date=2025-11-15&rft.issn=1526-1719&rft.eissn=1526-1719&rft.volume=29&rft.issue=1&rft.spage=289&rft.epage=320&rft_id=info:doi/10.7155%2Fjgaa.v29i1.2979&rft.externalDBID=n%2Fa&rft.externalDocID=10_7155_jgaa_v29i1_2979 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1526-1719&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1526-1719&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1526-1719&client=summon |