{"doi":"10.1145/3579654.3579768","title":"An Efficient Alternative to Subgraph Isomorphism and Its Advantages","abstract":null,"journal":"Proceedings of the 2022 5th International Conference on Algorithms, Computing and Artificial Intelligence","year":2022,"id":18436,"datarank":0.0,"base_score":0.0,"endowment":0.0,"self_citation_contribution":0.0,"citation_network_contribution":0.0,"self_endowment_contribution":0.0,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":0,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"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":128169,"name":"George P. Chan","orcid":"0000-0001-6674-0202","position":1,"is_corresponding":false},{"id":128171,"name":"Wai Kin (Victor) Chan","orcid":"0000-0002-7202-1922","position":2,"is_corresponding":false},{"id":128166,"name":"Wenjie Zhang","orcid":"0000-0001-9856-344X","position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"base_score":0.0,"endowment":0.0,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"24259432","pmcid":null,"openalex_id":"https://openalex.org/W4324266426","authors":[],"funders":[{"funder_name":"National Natural Science Foundation of China","grant_id":"71971127","title":null},{"funder_name":"Science and Technology Innovation Commission of Shenzhen","grant_id":"JCYJ20210324135011030","title":null},{"funder_name":"High-end Foreign Expert Talent Introduction Plan","grant_id":"G2021032022L","title":null}],"total_grants":3,"fwci":0.0,"citation_percentile":0.15738609,"influential_citations":0,"citation_trend":[],"oa_status":"gold","license":"cc-by","oa_locations":[{"url":"https://dl.acm.org/doi/pdf/10.1145/3579654.3579768","host_type":""},{"url":"https://doi.org/10.1145/3579654.3579768","host_type":"CLOSED"},{"url":"https://dl.acm.org/doi/pdf/10.1145/3579654.3579768","host_type":""},{"url":"https://dl.acm.org/doi/10.1145/3579654.3579768","host_type":"publisher"}],"fields_of_study":["Graph Theory and Algorithms","Advanced Graph Neural Networks","Distributed systems and fault tolerance","Computer Science","Mathematics"],"mesh_terms":[],"keywords":["Subgraph isomorphism problem","Factor-critical graph","Induced subgraph isomorphism problem","Graph factorization","Distance-hereditary graph","Null graph","Computer science","Line graph","Graph property","Graph isomorphism","Voltage graph","Theoretical computer science","Complement graph","Mathematics","Combinatorics","Graph"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-06-03T21:59:03.131158Z","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":[]}