乐胖代购免代理版

{"id":"https://openalex.org/W2067974691","doi":"https://doi.org/10.1016/j.dam.2009.03.006","title":"On the complexity of recognizing directed path families","display_name":"On the complexity of recognizing directed path families","publication_year":2009,"publication_date":"2009-04-16","ids":{"openalex":"https://openalex.org/W2067974691","doi":"https://doi.org/10.1016/j.dam.2009.03.006","mag":"2067974691"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2009.03.006","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.dam.2009.03.006","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068548647","display_name":"Nicola Apollonio","orcid":"https://orcid.org/0000-0001-6089-1333"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"N. Apollonio","raw_affiliation_strings":["Dipartimento di Statistica, Probabilit\u00ed e Statistiche Applicate, Universit\u00ed di Roma La Sapienza, piazzale Aldo Moro 5, I-00185 Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Statistica, Probabilit\u00ed e Statistiche Applicate, Universit\u00ed di Roma La Sapienza, piazzale Aldo Moro 5, I-00185 Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045218419","display_name":"Paolo Giulio Franciosa","orcid":"https://orcid.org/0000-0002-5464-4069"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"P.G. Franciosa","raw_affiliation_strings":["Dipartimento di Statistica, Probabilit\u00ed e Statistiche Applicate, Universit\u00ed di Roma La Sapienza, piazzale Aldo Moro 5, I-00185 Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Statistica, Probabilit\u00ed e Statistiche Applicate, Universit\u00ed di Roma La Sapienza, piazzale Aldo Moro 5, I-00185 Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2750,"currency":"USD","value_usd":2750,"provenance":"doaj"},"apc_paid":{"value":2750,"currency":"USD","value_usd":2750,"provenance":"doaj"},"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.401022,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":64,"max":71},"biblio":{"volume":"157","issue":"11","first_page":"2525","last_page":"2535"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997,"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.9997,"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/T11567","display_name":"semigroups and automata theory","score":0.9989,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9941,"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/family-of-sets","display_name":"Family of sets","score":0.61411107},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.47644928},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.45163757},{"id":"https://openalex.org/keywords/finite-graph","display_name":"Finite graph","score":0.42513388}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8168391},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7585735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7349879},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.69397324},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.622512},{"id":"https://openalex.org/C150591576","wikidata":"https://www.wikidata.org/wiki/Q739925","display_name":"Family of sets","level":3,"score":0.61411107},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.47644928},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.476077},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.45163757},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4507114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44232008},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.43773666},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.43054643},{"id":"https://openalex.org/C2994516854","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Finite graph","level":3,"score":0.42513388},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1193541},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2009.03.006","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.dam.2009.03.006","pdf_url":null,"source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"publisher-specific-oa","license_id":"https://openalex.org/licenses/publisher-specific-oa","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.68,"display_name":"Quality education"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":23,"referenced_works":["https://openalex.org/W1530753374","https://openalex.org/W1579049696","https://openalex.org/W183790757","https://openalex.org/W1963547452","https://openalex.org/W1963852739","https://openalex.org/W1976489861","https://openalex.org/W1981295749","https://openalex.org/W1990118448","https://openalex.org/W1993412054","https://openalex.org/W1999214321","https://openalex.org/W2006832642","https://openalex.org/W2012200612","https://openalex.org/W2017793597","https://openalex.org/W2018341366","https://openalex.org/W2036751548","https://openalex.org/W2081601236","https://openalex.org/W2089465933","https://openalex.org/W2091851332","https://openalex.org/W2170668134","https://openalex.org/W2577446513","https://openalex.org/W4233558979","https://openalex.org/W4235990349","https://openalex.org/W606453859"],"related_works":["https://openalex.org/W4300165677","https://openalex.org/W4297817344","https://openalex.org/W4287028074","https://openalex.org/W4214487273","https://openalex.org/W3191289342","https://openalex.org/W3164774158","https://openalex.org/W2372211403","https://openalex.org/W2146569528","https://openalex.org/W2106828717","https://openalex.org/W1498463151"],"abstract_inverted_index":{"A":[0],"Directed":[1,43],"Path":[2,44],"Family":[3],"is":[4,41,46,96,106],"a":[5,38,42,65,72,85,107],"family":[6,40,45,56,66],"of":[7,9,22,64,67,74,99,101],"subsets":[8],"some":[10,27,77,102],"finite":[11,78],"ground":[12],"set":[13,98],"whose":[14],"members":[15,53],"can":[16],"be":[17],"realized":[18],"as":[19],"arc":[20],"sets":[21],"simple":[23],"directed":[24,28,86],"paths":[25],"in":[26,54,93,104],"graph.":[29],"In":[30],"this":[31],"paper":[32],"we":[33,69],"show":[34],"that":[35,90],"recognizing":[36],"whether":[37,82],"given":[39,71],"an":[47],"NP-Complete":[48],"problem,":[49],"even":[50],"when":[51],"all":[52],"the":[55,94,97],"have":[57],"at":[58],"most":[59],"two":[60],"elements.":[61],"If":[62],"instead":[63],"subsets,":[68],"are":[70],"collection":[73],"words":[75],"from":[76],"alphabet,":[79],"then":[80],"deciding":[81],"there":[83],"exists":[84],"graph":[87],"G":[88],"such":[89],"each":[91],"word":[92],"language":[95],"arcs":[100],"path":[103],"G,":[105],"polynomial-time":[108],"solvable":[109],"problem.":[110]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2067974691","counts_by_year":[{"year":2016,"cited_by_count":1}],"updated_date":"2024-12-09T11:40:07.577725","created_date":"2016-06-24"}