{"id":"https://openalex.org/W2737681936","doi":"https://doi.org/10.1109/tkde.2017.2730873","title":"On Minimal Steiner Maximum-Connected Subgraph Queries","display_name":"On Minimal Steiner Maximum-Connected Subgraph Queries","publication_year":2017,"publication_date":"2017-07-24","ids":{"openalex":"https://openalex.org/W2737681936","doi":"https://doi.org/10.1109/tkde.2017.2730873","mag":"2737681936"},"language":"en","primary_location":{"id":"doi:10.1109/tkde.2017.2730873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2017.2730873","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/A5103257531","display_name":"Jiafeng Hu","orcid":"https://orcid.org/0000-0002-5108-5820"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Jiafeng Hu","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072788986","display_name":"Xiaowei Wu","orcid":"https://orcid.org/0000-0002-5766-2115"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Xiaowei Wu","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005847882","display_name":"Reynold Cheng","orcid":"https://orcid.org/0000-0002-9480-9809"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Reynold Cheng","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077949136","display_name":"Siqiang Luo","orcid":"https://orcid.org/0000-0001-8197-0903"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Siqiang Luo","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043494334","display_name":"Yixiang Fang","orcid":"https://orcid.org/0000-0002-5047-8593"},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yixiang Fang","raw_affiliation_strings":["Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Hong Kong, Pokfulam Road, Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5103257531"],"corresponding_institution_ids":["https://openalex.org/I889458895"],"apc_list":null,"apc_paid":null,"fwci":3.9467,"has_fulltext":false,"cited_by_count":41,"citation_normalized_percentile":{"value":0.94417797,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"29","issue":"11","first_page":"2455","last_page":"2469"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"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"}},"topics":[{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9988999962806702,"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/T10064","display_name":"Complex Network Analysis Techniques","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.7464619874954224},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5522527098655701},{"id":"https://openalex.org/keywords/subgraph-isomorphism-problem","display_name":"Subgraph isomorphism problem","score":0.5519112348556519},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48338380455970764},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.472839891910553},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.4289478659629822},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.42480552196502686},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4130343198776245},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.4121054410934448},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38634192943573},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3807733654975891},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30519720911979675},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2565472424030304},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1186898946762085},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.10106292366981506}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7464619874954224},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5522527098655701},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.5519112348556519},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48338380455970764},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.472839891910553},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.4289478659629822},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.42480552196502686},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4130343198776245},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.4121054410934448},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38634192943573},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3807733654975891},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30519720911979675},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2565472424030304},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1186898946762085},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.10106292366981506},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tkde.2017.2730873","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tkde.2017.2730873","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"},{"id":"pmh:oai:hub.hku.hk:10722/243929","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/243929","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4815539019","display_name":null,"funder_award_id":"102009508","funder_id":"https://openalex.org/F4320322170","funder_display_name":"University of Hong Kong"},{"id":"https://openalex.org/G5903160756","display_name":null,"funder_award_id":"104004129","funder_id":"https://openalex.org/F4320322170","funder_display_name":"University of Hong Kong"},{"id":"https://openalex.org/G824397466","display_name":null,"funder_award_id":"17217716","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"},{"id":"https://openalex.org/G8343556855","display_name":null,"funder_award_id":"HKU 17229116","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"},{"id":"https://openalex.org/G8618267314","display_name":null,"funder_award_id":"17205115","funder_id":"https://openalex.org/F4320321592","funder_display_name":"Research Grants Council, University Grants Committee"}],"funders":[{"id":"https://openalex.org/F4320321592","display_name":"Research Grants Council, University Grants Committee","ror":"https://ror.org/00djwmt25"},{"id":"https://openalex.org/F4320322170","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86"},{"id":"https://openalex.org/F4320334890","display_name":"University Research Committee, University of Hong Kong","ror":"https://ror.org/02zhqgq86"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W248604449","https://openalex.org/W776559747","https://openalex.org/W950821216","https://openalex.org/W1574303240","https://openalex.org/W1596627253","https://openalex.org/W1964043357","https://openalex.org/W1964419312","https://openalex.org/W1980162113","https://openalex.org/W1983365058","https://openalex.org/W1984903982","https://openalex.org/W1990317614","https://openalex.org/W1998644443","https://openalex.org/W2008316760","https://openalex.org/W2023536175","https://openalex.org/W2023655578","https://openalex.org/W2037487875","https://openalex.org/W2055245094","https://openalex.org/W2061901927","https://openalex.org/W2070593017","https://openalex.org/W2079007492","https://openalex.org/W2095072199","https://openalex.org/W2098664737","https://openalex.org/W2117889403","https://openalex.org/W2119995149","https://openalex.org/W2125895010","https://openalex.org/W2142599626","https://openalex.org/W2144543704","https://openalex.org/W2148606255","https://openalex.org/W2152495216","https://openalex.org/W2207622687","https://openalex.org/W2212315060","https://openalex.org/W2314240464","https://openalex.org/W2490322078","https://openalex.org/W2509839041","https://openalex.org/W2538025144","https://openalex.org/W2547646153","https://openalex.org/W2594188495","https://openalex.org/W2621145626","https://openalex.org/W2751051411","https://openalex.org/W2963054764","https://openalex.org/W3144088146","https://openalex.org/W6635711981"],"related_works":["https://openalex.org/W2532922352","https://openalex.org/W2361654510","https://openalex.org/W2036065890","https://openalex.org/W1983171305","https://openalex.org/W2142652836","https://openalex.org/W2376954560","https://openalex.org/W2463317516","https://openalex.org/W1574619705","https://openalex.org/W2153952206","https://openalex.org/W1594283629"],"abstract_inverted_index":{"Given":[0],"a":[1,5,80,155,171],"graph":[2,181],"G":[3,103],"and":[4,40,121,179,186],"set":[6],"Q":[7,27,168],"of":[8,62,71,82,102,170,188],"query":[9],"nodes,":[10,83],"we":[11,92],"examine":[12],"the":[13,29,46,57,65,69,74,94,99,105,129,161,184],"Steiner":[14],"Maximum-Connected":[15],"Subgraph":[16],"(SMCS)":[17],"problem.":[18],"The":[19,110],"SMCS,":[20,59,76,96],"or":[21],"G's":[22],"induced":[23],"subgraph":[24,101],"that":[25],"contains":[26,113],"with":[28,104,149],"largest":[30,66],"connectivity,":[31],"can":[32,84,132],"be":[33,85,126,133],"useful":[34],"for":[35,163],"customer":[36],"prediction,":[37],"product":[38],"promotion,":[39],"team":[41],"assembling.":[42],"Despite":[43],"its":[44,118],"importance,":[45],"SMCS":[47,112,131],"problem":[48],"has":[49],"only":[50],"been":[51],"recently":[52],"studied.":[53],"Existing":[54],"solutions":[55],"evaluate":[56],"maximum":[58,75,106,119],"whose":[60],"number":[61],"nodes":[63,116],"is":[64,98,122],"among":[67],"all":[68],"SMCSs":[70],"Q.":[72,109],"However,":[73,128],"which":[77,97],"may":[78],"contain":[79],"lot":[81],"difficult":[86],"to":[87,125,135,159],"interpret.":[88],"In":[89],"this":[90],"paper,":[91],"investigate":[93],"minimal":[95,100,111,130],"connectivity":[107],"containing":[108],"much":[114],"fewer":[115],"than":[117],"counterpart,":[120],"thus":[123,138],"easier":[124],"understood.":[127],"costly":[134],"evaluate.":[136],"We":[137,152],"propose":[139],"efficient":[140],"Expand-Refine":[141],"algorithms,":[142],"as":[143,145],"well":[144],"their":[146],"approximate":[147],"versions":[148],"accuracy":[150],"guarantees.":[151],"further":[153],"develop":[154],"cache-based":[156],"processing":[157],"model":[158],"improve":[160],"efficiency":[162,187],"an":[164],"important":[165],"case":[166],"when":[167],"consists":[169],"single":[172],"node.":[173],"Extensive":[174],"experiments":[175],"on":[176],"large":[177],"real":[178],"synthetic":[180],"datasets":[182],"validate":[183],"effectiveness":[185],"our":[189],"approaches.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2017-07-31T00:00:00"}