{"id":"https://openalex.org/W3084637480","doi":"https://doi.org/10.1137/20m1350571","title":"More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints","display_name":"More Applications of the $d$-Neighbor Equivalence: Acyclicity and Connectivity Constraints","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3084637480","doi":"https://doi.org/10.1137/20m1350571","mag":"3084637480"},"language":"en","primary_location":{"id":"doi:10.1137/20m1350571","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1350571","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},"type":"preprint","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/abs/1805.11275v7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081688617","display_name":"Benjamin Bergougnoux","orcid":"https://orcid.org/0000-0002-6270-3663"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Benjamin Bergougnoux","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5107904564","display_name":"Mamadou Moustapha Kant\u00e9","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mamadou Moustapha Kant\u00e9","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081688617"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02509485,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"35","issue":"3","first_page":"1881","last_page":"1926"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T12288","display_name":"Optimization and Search Problems","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7938249111175537},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.6623246073722839},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6514744162559509},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5645920038223267},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5260962247848511},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4765130281448364},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.4636000692844391},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4360720217227936},{"id":"https://openalex.org/keywords/equivalence-relation","display_name":"Equivalence relation","score":0.4232303500175476},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.419242262840271},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.3796231746673584},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37436240911483765},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28985023498535156},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.18402612209320068},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.17217674851417542},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10694217681884766}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7938249111175537},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.6623246073722839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6514744162559509},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5645920038223267},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5260962247848511},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4765130281448364},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.4636000692844391},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4360720217227936},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.4232303500175476},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.419242262840271},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3796231746673584},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37436240911483765},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28985023498535156},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.18402612209320068},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.17217674851417542},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10694217681884766},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/20m1350571","is_oa":false,"landing_page_url":"https://doi.org/10.1137/20m1350571","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","raw_type":"journal-article"},{"id":"mag:3084637480","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1805.11275v7","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:HAL:hal-04492610v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04492610","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2021, 35 (3), pp.1881-1926. ⟨10.1137/20M1350571⟩","raw_type":"Journal articles"},{"id":"pmh:oai:bora.uib.no:11250/2987651","is_oa":true,"landing_page_url":"https://hdl.handle.net/11250/2987651","pdf_url":null,"source":{"id":"https://openalex.org/S4306401716","display_name":"Duo Research Archive (University of Oslo)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I184942183","host_organization_name":"University of Oslo","host_organization_lineage":["https://openalex.org/I184942183"],"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 Discrete Mathematics","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1805.11275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1805.11275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"mag:3084637480","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1805.11275v7","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2506045467","display_name":null,"funder_award_id":"ANR-15-CE40-0009","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W78054942","https://openalex.org/W115586599","https://openalex.org/W205622278","https://openalex.org/W284370259","https://openalex.org/W1922215400","https://openalex.org/W1964095725","https://openalex.org/W1969151326","https://openalex.org/W1985572324","https://openalex.org/W1993328543","https://openalex.org/W1995725694","https://openalex.org/W1999145171","https://openalex.org/W2008361472","https://openalex.org/W2034183528","https://openalex.org/W2047723482","https://openalex.org/W2047871605","https://openalex.org/W2059273723","https://openalex.org/W2063951771","https://openalex.org/W2067264828","https://openalex.org/W2074937107","https://openalex.org/W2081971779","https://openalex.org/W2149785904","https://openalex.org/W2154682992","https://openalex.org/W2180988813","https://openalex.org/W2309721867","https://openalex.org/W2508369034","https://openalex.org/W2609079257","https://openalex.org/W2940485869","https://openalex.org/W2962055031","https://openalex.org/W2963390736","https://openalex.org/W2963520829","https://openalex.org/W2980611413","https://openalex.org/W2989722117","https://openalex.org/W2995628723","https://openalex.org/W2997214368","https://openalex.org/W2998413209","https://openalex.org/W3097733747","https://openalex.org/W3139078859","https://openalex.org/W4238913085"],"related_works":["https://openalex.org/W2964327191","https://openalex.org/W2063951771","https://openalex.org/W2224152264","https://openalex.org/W3184951419","https://openalex.org/W2900662096","https://openalex.org/W1500696169","https://openalex.org/W1758579031","https://openalex.org/W2763447936","https://openalex.org/W2964301480","https://openalex.org/W2952630606","https://openalex.org/W2468706558","https://openalex.org/W2783934758","https://openalex.org/W854382448","https://openalex.org/W2981749766","https://openalex.org/W2471680335","https://openalex.org/W2123734400","https://openalex.org/W2964080336","https://openalex.org/W110441439","https://openalex.org/W3158696645","https://openalex.org/W2980994391"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,153,197],"design":[4,41],"a":[5,15,42,80],"framework":[6,123,175],"to":[7],"obtain":[8,154,198],"efficient":[9],"algorithms":[10,90,110,204],"for":[11,91,111,179],"several":[12],"problems":[13,48,114,181],"with":[14],"global":[16],"constraint":[17],"(acyclicity":[18],"or":[19],"connectivity)":[20],"such":[21,115,185],"as":[22,116,186],"Connected":[23],"Dominating":[24,120],"Set,":[25],"Node":[26],"Weighted":[27],"Steiner":[28],"Tree,":[29,32],"Maximum":[30,190],"Induced":[31,34],"Longest":[33],"Path,":[35],"and":[36,49,64,74,86,96,119,134,138,147,189,201,213],"Feedback":[37],"Vertex":[38,117],"Set.":[39,121],"We":[40,170],"meta-algorithm":[43],"that":[44,173],"solves":[45],"all":[46],"these":[47,194],"whose":[50],"running":[51,98,104],"time":[52,99,203],"is":[53,68,124,207],"upper":[54],"bounded":[55],"by":[56,183],"$2^{O(k)}\\cdot":[57],"n^{O(1)}$,":[58,61],"$2^{O(k":[59],"\\log(k))}\\cdot":[60],"$2^{O(k^2)}\\cdot":[62],"n^{O(1)}$":[63],"$n^{O(k)}$":[65,200],"where":[66,205],"$k$":[67,206],"respectively":[69,208],"the":[70,88,94,103,107,127,139,156,159,164,209,211,214,217],"clique-width,":[71,210],"$\\mathbf{Q}$-rank-width,":[72],"rank-width":[73,215],"maximum":[75],"induced":[76],"matching":[77],"width":[78,168],"of":[79,93,106,158,167,216],"given":[81],"decomposition.":[82],"Our":[83,122],"approach":[84,141],"simplifies":[85],"unifies":[87],"known":[89,109],"each":[92],"parameters":[95],"its":[97],"matches":[100],"asymptotically":[101],"also":[102,171],"times":[105],"best":[108],"basic":[112],"NP-hard":[113],"Cover":[118],"based":[125],"on":[126,163],"$d$-neighbor":[128,160],"equivalence":[129,161],"defined":[130],"in":[131,143],"[Bui-Xuan,":[132],"Telle":[133],"Vatshelle,":[135],"TCS":[136],"2013]":[137],"rank-based":[140],"introduced":[142],"[Bodlaender,":[144],"Cygan,":[145],"Kratsch":[146],"Nederlof,":[148],"ICALP":[149],"2013].":[150],"The":[151],"results":[152],"highlight":[155],"importance":[157],"relation":[162],"algorithmic":[165],"applications":[166],"measures.":[169],"prove":[172],"our":[174],"could":[176],"be":[177],"useful":[178],"$W[1]$-hard":[180],"parameterized":[182],"clique-width":[184],"Max":[187],"Cut":[188],"Minimal":[191],"Cut.":[192],"For":[193],"latter":[195],"problems,":[196],"$n^{O(k)}$,":[199],"$n^{2^{O(k)}}$":[202],"$\\mathbf{Q}$-rank-width":[212],"input":[218],"graph.":[219]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-10-10T00:00:00"}