{"doi":"10.1007/978-3-642-15939-8_33","title":"Many-to-Many Graph Matching: A Continuous Relaxation Approach","abstract":null,"journal":"Lecture Notes in Computer Science","year":2010,"id":17026,"datarank":2.2200107241161215,"base_score":3.091042453358316,"endowment":3.091042453358316,"self_citation_contribution":0.4636563680037475,"citation_network_contribution":1.756354356112374,"self_endowment_contribution":0.4636563680037475,"citer_contribution":1.756354356112374,"corpus_percentile":null,"corpus_rank":null,"citation_count":21,"citer_count":21,"citers_with_citation_signal":17,"citers_with_endowment":17,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":123314,"name":"Francis Bach","orcid":null,"position":1,"is_corresponding":false},{"id":89926,"name":"Jean-Philippe Vert","orcid":null,"position":2,"is_corresponding":false},{"id":12238,"name":"Mikhail Zaslavskiy","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":3.091042453358316,"endowment":3.091042453358316,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"21071399","pmcid":null,"openalex_id":"https://openalex.org/W2111740312","authors":[],"funders":[],"total_grants":0,"fwci":1.5465,"citation_percentile":0.86479386,"influential_citations":2,"citation_trend":[{"year":2012,"count":1},{"year":2014,"count":3},{"year":2015,"count":2},{"year":2016,"count":3},{"year":2017,"count":2},{"year":2018,"count":1},{"year":2019,"count":1},{"year":2021,"count":1},{"year":2022,"count":1},{"year":2023,"count":1}],"oa_status":"green","license":"http://www.springer.com/tdm","oa_locations":[{"url":"https://arxiv.org/pdf/1004.4965","host_type":"repository"},{"url":"https://link.springer.com/content/pdf/10.1007%2F978-3-642-15939-8_33.pdf","host_type":"BRONZE"},{"url":"https://arxiv.org/pdf/1004.4965","host_type":"repository"},{"url":"http://link.springer.com/content/pdf/10.1007/978-3-642-15939-8_33","host_type":"publisher"},{"url":"http://arxiv.org/abs/1004.4965","host_type":"repository"},{"url":"https://doi.org/10.1007/978-3-642-15939-8_33","host_type":"book series"},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.257","host_type":""},{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.762.8213","host_type":""},{"url":"https://hal.science/hal-00465916","host_type":"repository"}],"fields_of_study":["Graph Theory and Algorithms","Interconnection Networks and Systems","Data Management and Algorithms","Mathematics","Computer Science"],"mesh_terms":[],"keywords":["Computer science","Theoretical computer science","Matching (statistics)","Graph","Algorithm","Combinatorics","Mathematics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-02T16:04:51.807911Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}