{"id":"https://openalex.org/W2997095431","doi":"https://doi.org/10.1137/20m1375048","title":"Proximity Search for Maximal Subgraph Enumeration","display_name":"Proximity Search for Maximal Subgraph Enumeration","publication_year":2022,"publication_date":"2022-10-28","ids":{"openalex":"https://openalex.org/W2997095431","doi":"https://doi.org/10.1137/20m1375048","mag":"2997095431"},"language":"en","primary_location":{"id":"doi:10.1137/20m1375048","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1375048","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-03913673","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086573637","display_name":"Alessio Conte","orcid":"https://orcid.org/0000-0003-0770-2235"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessio Conte","raw_affiliation_strings":["Department of Computer Science, University of Pisa, Pisa, Italy (, )"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pisa, Pisa, Italy (, )","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006984021","display_name":"Roberto Grossi","orcid":"https://orcid.org/0000-0002-7985-4222"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Roberto Grossi","raw_affiliation_strings":["Department of Computer Science, University of Pisa, Pisa, Italy (, )"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Pisa, Pisa, Italy (, )","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035852380","display_name":"Andrea Marino","orcid":"https://orcid.org/0000-0002-9854-7885"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Andrea Marino","raw_affiliation_strings":["Department of Statistics, Computer Science, and Applications, University of Florence, Florence, Italy ()"],"affiliations":[{"raw_affiliation_string":"Department of Statistics, Computer Science, and Applications, University of Florence, Florence, Italy ()","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076101253","display_name":"Takeaki Uno","orcid":"https://orcid.org/0000-0001-7274-279X"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takeaki Uno","raw_affiliation_strings":["National Institute of Informatics, Tokyo, Japan ()"],"affiliations":[{"raw_affiliation_string":"National Institute of Informatics, Tokyo, Japan ()","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090111536","display_name":"Luca Versari","orcid":"https://orcid.org/0000-0003-3495-1325"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Luca Versari","raw_affiliation_strings":["University of Pisa, Pisa, Italy. Current address: Google Research, Zurich, Switzerland ()"],"affiliations":[{"raw_affiliation_string":"University of Pisa, Pisa, Italy. Current address: Google Research, Zurich, Switzerland ()","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5086573637"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":1.2023,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.80294666,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"51","issue":"5","first_page":"1580","last_page":"1625"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9898999929428101,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/enumeration","display_name":"Enumeration","score":0.642194926738739},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6385124325752258},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5379059910774231},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5157999992370605},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4800318777561188},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.47706639766693115},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.47258031368255615},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.4634864628314972},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4539213180541992},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4457653760910034},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.4438770115375519},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.42123767733573914},{"id":"https://openalex.org/keywords/epigraph","display_name":"Epigraph","score":0.41478702425956726},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3597254157066345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28658750653266907},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24433273077011108},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.22994008660316467}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.642194926738739},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6385124325752258},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5379059910774231},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5157999992370605},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4800318777561188},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.47706639766693115},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.47258031368255615},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.4634864628314972},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4539213180541992},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4457653760910034},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.4438770115375519},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.42123767733573914},{"id":"https://openalex.org/C17192189","wikidata":"https://www.wikidata.org/wiki/Q1347059","display_name":"Epigraph","level":2,"score":0.41478702425956726},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3597254157066345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28658750653266907},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24433273077011108},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.22994008660316467},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/20m1375048","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1375048","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-03913673v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03913673","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2022, 51 (5), pp.1580-1625. ⟨10.1137/20M1375048⟩","raw_type":"Journal articles"},{"id":"pmh:oai:arpi.unipi.it:11568/1167726","is_oa":false,"landing_page_url":"https://hdl.handle.net/11568/1167726","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:flore.unifi.it:2158/1309543","is_oa":false,"landing_page_url":"https://hdl.handle.net/2158/1309543","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03913673v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03913673","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2022, 51 (5), pp.1580-1625. ⟨10.1137/20M1375048⟩","raw_type":"Journal articles"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1110931696","display_name":null,"funder_award_id":"JPMJCR1401","funder_id":"https://openalex.org/F4320334789","funder_display_name":"Japan Science and Technology Agency"}],"funders":[{"id":"https://openalex.org/F4320334789","display_name":"Japan Science and Technology Agency","ror":"https://ror.org/00097mb19"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W1030513622","https://openalex.org/W1485742133","https://openalex.org/W1563192285","https://openalex.org/W1569588123","https://openalex.org/W1608090047","https://openalex.org/W1922215400","https://openalex.org/W1974624244","https://openalex.org/W1974784305","https://openalex.org/W1978544932","https://openalex.org/W1986022261","https://openalex.org/W1988738304","https://openalex.org/W2007940874","https://openalex.org/W2010621321","https://openalex.org/W2013568176","https://openalex.org/W2024519892","https://openalex.org/W2030996579","https://openalex.org/W2041588579","https://openalex.org/W2049074379","https://openalex.org/W2049164482","https://openalex.org/W2063498317","https://openalex.org/W2085870956","https://openalex.org/W2086119402","https://openalex.org/W2089417393","https://openalex.org/W2089465933","https://openalex.org/W2093776691","https://openalex.org/W2098467469","https://openalex.org/W2113280143","https://openalex.org/W2119741712","https://openalex.org/W2160429376","https://openalex.org/W2172016099","https://openalex.org/W2317565191","https://openalex.org/W2562025642","https://openalex.org/W2728920311","https://openalex.org/W2743656927","https://openalex.org/W2926809310","https://openalex.org/W2951327881","https://openalex.org/W2963385664","https://openalex.org/W3020746289","https://openalex.org/W3036666109","https://openalex.org/W3038553811","https://openalex.org/W3082917204","https://openalex.org/W3105005952","https://openalex.org/W3198160809","https://openalex.org/W3214957292"],"related_works":["https://openalex.org/W2355558294","https://openalex.org/W2392366684","https://openalex.org/W2381998515","https://openalex.org/W2393671386","https://openalex.org/W2377617670","https://openalex.org/W2713931874","https://openalex.org/W2361142453","https://openalex.org/W3164236790","https://openalex.org/W2364727532","https://openalex.org/W2020434980"],"abstract_inverted_index":{"This":[0,165],"paper":[1],"proposes":[2],"a":[3,132,139,144,199,223,227],"new":[4],"general":[5],"technique":[6,41,224],"for":[7,24,46,49],"maximal":[8,60,63,69,74,88],"subgraph":[9],"enumeration":[10,22,58],"which":[11,50,146,152,216],"we":[12,42,147,153,220],"call":[13,148],"proximity":[14,129],"search,":[15,83],"whose":[16,170],"aim":[17],"is":[18,131,206],"to":[19,120,137,161,180,210,225],"design":[20],"efficient":[21],"algorithms":[23,45,52],"problems":[25,48,160],"that":[26,134,184,189],"could":[27],"not":[28,54],"be":[29,121,193,218],"solved":[30],"by":[31,104,151,198],"existing":[32,181],"frameworks.":[33],"To":[34],"support":[35],"this":[36,110,204],"claim":[37],"and":[38,73,100,143,232],"illustrate":[39],"the":[40,57,84,156,207],"include":[43],"output-polynomial":[44,51],"several":[47],"were":[53],"known,":[55],"including":[56],"of":[59,86,128,158,203,213],"bipartite":[61],"subgraphs,":[62,72],"k-degenerate":[64],"subgraphs":[65],"(for":[66],"bounded":[67],"k),":[68],"induced":[70,75],"chordal":[71],"trees.":[76],"Using":[77],"known":[78],"techniques,":[79],"such":[80,163],"as":[81],"reverse":[82],"space":[85,208,235],"all":[87,190],"solutions":[89,101,191,231],"induces":[90],"an":[91],"implicit":[92],"directed":[93],"graph":[94,111],"called":[95],"\u201csolution":[96],"graph\u201d":[97],"or":[98],"\u201csupergraph,\u201d":[99],"are":[102,239],"enumerated":[103,194],"traversing":[105],"it;":[106],"however,":[107],"nodes":[108,171],"in":[109,167,195],"can":[112,154,192,217],"have":[113,172],"exponential":[114,118],"out-degree,":[115],"thus":[116],"requiring":[117],"time":[119],"spent":[122],"on":[123],"each":[124],"solution.":[125],"The":[126],"novelty":[127],"search":[130],"formalization":[133],"allows":[135],"us":[136],"define":[138],"better":[140],"solution":[141,168],"graph,":[142],"technique,":[145],"canonical":[149],"reconstruction,":[150],"exploit":[155],"properties":[157],"given":[159],"build":[162],"graphs.":[164],"results":[166],"graphs":[169],"significantly":[173],"smaller":[174],"(i.e.,":[175],"polynomial)":[176],"out-degree":[177],"with":[178],"respect":[179],"approaches,":[182],"but":[183],"remain":[185],"strongly":[186],"connected,":[187],"so":[188],"polynomial":[196,234],"delay":[197],"traversal.":[200],"A":[201],"drawback":[202],"approach":[205],"required":[209],"keep":[211],"track":[212],"visited":[214],"solutions,":[215],"exponential;":[219],"further":[221],"propose":[222],"induce":[226],"parent-child":[228],"relationship":[229],"among":[230],"achieve":[233],"when":[236],"suitable":[237],"conditions":[238],"met.":[240]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}