{"id":"https://openalex.org/W2962799203","doi":"https://doi.org/10.1007/s00453-019-00659-5","title":"On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths","display_name":"On the Complexity of Finding Internally Vertex-Disjoint Long Directed Paths","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W2962799203","doi":"https://doi.org/10.1007/s00453-019-00659-5","mag":"2962799203"},"language":"en","primary_location":{"id":"pmh:oai:flore.unifi.it:2158/1351933","is_oa":false,"landing_page_url":"https://hdl.handle.net/2158/1351933","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":null,"raw_type":"info:eu-repo/semantics/article"},"type":"article","indexed_in":[],"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/A5054272226","display_name":"J\u00falio Ar\u00e1ujo","orcid":"https://orcid.org/0000-0001-7074-2753"},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"ARAU\u0301JO","raw_affiliation_strings":["Departamento de Matem\u00e1tica, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":null,"display_name":"JU\u0301LIO","orcid":null},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"JU\u0301LIO","raw_affiliation_strings":["Departamento de Computa\u00e7\u00e3o, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Computa\u00e7\u00e3o, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":null,"display_name":"CAMPOS","orcid":null},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"CAMPOS","raw_affiliation_strings":["Departamento de Computa\u00e7\u00e3o, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Computa\u00e7\u00e3o, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":null,"display_name":"VICTOR A.","orcid":null},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"VICTOR A.","raw_affiliation_strings":["Departamento de Matem\u00e1tica, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":null,"display_name":"MAIA","orcid":null},"institutions":[{"id":"https://openalex.org/I243754102","display_name":"Universidade Federal do Cear\u00e1","ror":"https://ror.org/03srtnf24","country_code":"BR","type":"education","lineage":["https://openalex.org/I243754102"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"MAIA","raw_affiliation_strings":["Departamento de Matem\u00e1tica, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, ParGO Research Group, Universidade Federal do Cear\u00e1, Fortaleza, Brazil","institution_ids":["https://openalex.org/I243754102"]}]},{"author_position":"middle","author":{"id":null,"display_name":"ANA KAROLINNA","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ANA KAROLINNA","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"SAU","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"SAU","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"IGNASI","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"IGNASI","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Ferreira da Silva A","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ferreira da Silva A","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1381,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48300725,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9975000023841858,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8125081062316895},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7725205421447754},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.7565550804138184},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7025194764137268},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5388967394828796},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5051575303077698},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5020737648010254},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.49937963485717773},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48269200325012207},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4773285984992981},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32072117924690247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20049545168876648}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8125081062316895},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7725205421447754},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7565550804138184},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7025194764137268},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5388967394828796},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5051575303077698},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5020737648010254},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.49937963485717773},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48269200325012207},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4773285984992981},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32072117924690247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20049545168876648}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:flore.unifi.it:2158/1351933","is_oa":false,"landing_page_url":"https://hdl.handle.net/2158/1351933","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":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1535968106","display_name":"Efficiency and Structure in Graph Mining Applications","funder_award_id":"ANR-17-CE23-0010","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4257764118","display_name":null,"funder_award_id":"304576/2017-4 and 304478/2018-0, CNPq Universal Project 401519/2016-3","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G471180816","display_name":null,"funder_award_id":"FUNCAP-PRONEM PNE-0112-00061.01.00/16","funder_id":"https://openalex.org/F4320323202","funder_display_name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G5140280351","display_name":"Decomposition of Graphical Models","funder_award_id":"ANR-16-CE40-0028","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G8933902273","display_name":null,"funder_award_id":"DEMOGRAPH (ANR-16-CE40-0028) and ESIGMA (ANR-17-CE23-0010)","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"},{"id":"https://openalex.org/F4320321091","display_name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","ror":"https://ror.org/00x0ma614"},{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320323202","display_name":"Funda\u00e7\u00e3o Cearense de Apoio ao Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/007pgtp80"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1517036688","https://openalex.org/W1548164611","https://openalex.org/W1570425181","https://openalex.org/W1586904125","https://openalex.org/W1812837484","https://openalex.org/W1885568428","https://openalex.org/W1965012931","https://openalex.org/W1976519893","https://openalex.org/W1995725694","https://openalex.org/W1997702119","https://openalex.org/W2000065147","https://openalex.org/W2000733920","https://openalex.org/W2011039300","https://openalex.org/W2014546325","https://openalex.org/W2039100365","https://openalex.org/W2061597613","https://openalex.org/W2073076874","https://openalex.org/W2085634670","https://openalex.org/W2114935764","https://openalex.org/W2116087731","https://openalex.org/W2196811896","https://openalex.org/W2296148711","https://openalex.org/W2732334173","https://openalex.org/W2753014589","https://openalex.org/W2914414140","https://openalex.org/W2953294211","https://openalex.org/W2963205193","https://openalex.org/W2963925678","https://openalex.org/W2963955178","https://openalex.org/W2964052962","https://openalex.org/W3010951874","https://openalex.org/W3123130626","https://openalex.org/W3139078859","https://openalex.org/W4206244388","https://openalex.org/W4242581432","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2890358049","https://openalex.org/W1815974477","https://openalex.org/W4300569185","https://openalex.org/W2951548366","https://openalex.org/W2110193191","https://openalex.org/W143702185","https://openalex.org/W1988947197","https://openalex.org/W4255598955","https://openalex.org/W2765600275","https://openalex.org/W2953710272"],"abstract_inverted_index":{"For":[0],"two":[1,38,140],"positive":[2],"integers":[3],"k":[4,16,25,95,112],"and":[5,41,72,128,142,165,183,187],"$$\\ell":[6,32,85,121],"$$":[7,33],"\u2113":[8,18,34,88,114,124],",":[9,91,127],"a":[10,57,61,64,83,103,106,170],"$$(k":[11,107],"\\times":[12,108],"\\ell":[13,109],")$$":[14,110],"(":[15,111],"\u00d7":[17,113],")":[19,115],"-spindle":[20,116],"is":[21,117,181],"the":[22,47,69,78,93,151,158,175,178],"union":[23],"of":[24,50,63,105,160],"pairwise":[26],"internally":[27],"vertex-disjoint":[28],"directed":[29],"paths":[30,141],"with":[31,138],"arcs":[35],"each":[36],"between":[37],"vertices":[39],"u":[40],"v.":[42],"We":[43,76,131],"are":[44,147,155],"interested":[45],"in":[46,54,163],"(parameterized)":[48],"complexity":[49,80],"several":[51,185],"problems":[52],"consisting":[53],"deciding":[55],"whether":[56],"given":[58],"digraph":[59,100],"contains":[60,102],"subdivision":[62,104],"spindle,":[65],"which":[66],"generalize":[67],"both":[68],"Maximum":[70],"Flow":[71],"Longest":[73],"Path":[74],"problems.":[75],"obtain":[77],"following":[79],"dichotomy:":[81],"for":[82],"fixed":[84],"\\ge":[86],"1$$":[87],"\u2265":[89],"1":[90],"finding":[92,136],"largest":[94],"such":[96],"that":[97,146],"an":[98],"input":[99,179],"G":[101],"polynomial-time":[118],"solvable":[119],"if":[120],"\\le":[122],"3$$":[123],"\u2264":[125],"3":[126],"NP-hard":[129],"otherwise.":[130],"place":[132],"special":[133],"emphasis":[134],"on":[135,157],"spindles":[137],"exactly":[139],"present":[143,184],"FPT":[144],"algorithms":[145,154],"asymptotically":[148],"optimal":[149],"under":[150],"ETH.":[152],"These":[153],"based":[156],"technique":[159],"representative":[161],"families":[162],"matroids,":[164],"use":[166],"also":[167],"color-coding":[168],"as":[169],"subroutine.":[171],"Finally,":[172],"we":[173],"study":[174],"case":[176],"where":[177],"graph":[180],"acyclic,":[182],"algorithmic":[186],"hardness":[188],"results.":[189]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-18T08:10:14.011955","created_date":"2019-07-30T00:00:00"}