{"id":"https://openalex.org/W4210852225","doi":"https://doi.org/10.1109/tkde.2022.3148995","title":"Durable Subgraph Matching on Temporal Graphs","display_name":"Durable Subgraph Matching on Temporal Graphs","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4210852225","doi":"https://doi.org/10.1109/tkde.2022.3148995"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2022.3148995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2022.3148995","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101716365","display_name":"Faming Li","orcid":"https://orcid.org/0000-0001-5473-7524"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I4210161462","display_name":"Heilongjiang Institute of Technology","ror":"https://ror.org/05x0m9n95","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210161462"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Faming Li","raw_affiliation_strings":["School of Computer Science and Technology, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: lifaming2016@hit.edu.cn)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: lifaming2016@hit.edu.cn)","institution_ids":["https://openalex.org/I204983213","https://openalex.org/I4210161462"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087244952","display_name":"Zhaonian Zou","orcid":"https://orcid.org/0000-0001-9475-8944"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I4210161462","display_name":"Heilongjiang Institute of Technology","ror":"https://ror.org/05x0m9n95","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210161462"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhaonian Zou","raw_affiliation_strings":["School of Computer Science and Technology, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: znzou@hit.edu.cn)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: znzou@hit.edu.cn)","institution_ids":["https://openalex.org/I204983213","https://openalex.org/I4210161462"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100387071","display_name":"Jianzhong Li","orcid":"https://orcid.org/0000-0002-9580-206X"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]},{"id":"https://openalex.org/I4210161462","display_name":"Heilongjiang Institute of Technology","ror":"https://ror.org/05x0m9n95","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210161462"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jianzhong Li","raw_affiliation_strings":["School of Computer Science and Technology, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: lijzh@hit.edu.cn)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Technology, Harbin Institute of Technology, 47822 Harbin, Heilongjiang, China, (e-mail: lijzh@hit.edu.cn)","institution_ids":["https://openalex.org/I204983213","https://openalex.org/I4210161462"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0528,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.75119301,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7075982689857483},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5081191062927246},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4791219234466553},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47084924578666687},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.44757699966430664},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.44098854064941406},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.436599999666214},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.4167734682559967},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4138331413269043},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.38594767451286316},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21488654613494873},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.20037442445755005},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.11090222001075745},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.10794535279273987}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7075982689857483},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5081191062927246},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4791219234466553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47084924578666687},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.44757699966430664},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.44098854064941406},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.436599999666214},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.4167734682559967},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4138331413269043},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.38594767451286316},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21488654613494873},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.20037442445755005},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.11090222001075745},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.10794535279273987},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tkde.2022.3148995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2022.3148995","pdf_url":null,"source":{"id":"https://openalex.org/S30698027","display_name":"IEEE Transactions on Knowledge and Data Engineering","issn_l":"1041-4347","issn":["1041-4347","1558-2191","2326-3865"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320439","host_organization_name":"IEEE Computer Society","host_organization_lineage":["https://openalex.org/P4310320439","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Computer Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Knowledge and Data Engineering","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4894050043","display_name":null,"funder_award_id":"61832003","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"},{"id":"https://openalex.org/G8830363313","display_name":"\u57fa\u4e8e\u5c42\u7ec4\u5206\u6790\u6a21\u578b\u7684\u591a\u5c42\u56fe\u5206\u6790\u6280\u672f\u7814\u7a76","funder_award_id":"62072138","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1782565250","https://openalex.org/W1978066268","https://openalex.org/W2035609387","https://openalex.org/W2042639302","https://openalex.org/W2078210269","https://openalex.org/W2118212234","https://openalex.org/W2126359798","https://openalex.org/W2134152592","https://openalex.org/W2147405597","https://openalex.org/W2159891898","https://openalex.org/W2170726034","https://openalex.org/W2423652555","https://openalex.org/W2425142702","https://openalex.org/W2562676961","https://openalex.org/W2770213131","https://openalex.org/W2796285681","https://openalex.org/W2922308772","https://openalex.org/W2948742909","https://openalex.org/W2963904000","https://openalex.org/W2970871269","https://openalex.org/W3001619101","https://openalex.org/W3137504194","https://openalex.org/W3173249336","https://openalex.org/W4255889623","https://openalex.org/W6637956781","https://openalex.org/W6652054798"],"related_works":["https://openalex.org/W2145212918","https://openalex.org/W2892180138","https://openalex.org/W2951429970","https://openalex.org/W3208942821","https://openalex.org/W2536906705","https://openalex.org/W4387914616","https://openalex.org/W2886672068","https://openalex.org/W2953496651","https://openalex.org/W2351427475","https://openalex.org/W2004969038"],"abstract_inverted_index":{"Durable":[0],"subgraph":[1],"matching":[2,92],"on":[3],"a":[4,28,58],"temporal":[5,12,51],"graph":[6,13,21,52],"finds":[7],"all":[8],"subgraphs":[9],"in":[10],"the":[11,18,49,74,80,85,89,95,106,121],"that":[14,105],"not":[15],"only":[16],"match":[17],"given":[19],"query":[20,82],"but":[22],"also":[23],"have":[24],"duration":[25,30],"longer":[26],"than":[27,120],"user-specified":[29],"threshold.":[31],"The":[32,101],"state-of-the-art":[33,122],"algorithm":[34,60,108],"(Semertzidis":[35],"and":[36,94,115],"Pitoura,":[37],"2016,":[38],"2019)":[39],"for":[40],"solving":[41],"this":[42,56,65,77],"problem":[43],"requires":[44,116],"lots":[45],"of":[46,76,112],"memory":[47,119],"when":[48],"input":[50],"is":[53,61,109],"large.":[54],"In":[55],"paper,":[57],"new":[59],"proposed":[62,107],"to":[63,72],"solve":[64],"problem.":[66],"Many":[67],"effective":[68],"techniques":[69],"are":[70],"developed":[71],"improve":[73],"performance":[75],"algorithm,":[78],"including":[79],"DFS-based":[81],"decomposition":[83],"method,":[84],"TD-tree":[86],"index":[87],"structure,":[88],"sort-based":[90],"vertex":[91],"order,":[93],"time":[96],"instance":[97],"set":[98],"compaction":[99],"method.":[100],"experimental":[102],"results":[103],"show":[104],"an":[110],"order":[111],"magnitude":[113],"faster":[114],"significantly":[117],"less":[118],"algorithm.":[123]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}