{"id":"https://openalex.org/W4409983752","doi":"https://doi.org/10.46298/dmtcs.13355","title":"Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs","display_name":"Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs","publication_year":2025,"publication_date":"2025-05-01","ids":{"openalex":"https://openalex.org/W4409983752","doi":"https://doi.org/10.46298/dmtcs.13355"},"language":"en","primary_location":{"id":"doi:10.46298/dmtcs.13355","doi":"https://doi.org/10.46298/dmtcs.13355","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.13355","pdf_url":"https://dmtcs.episciences.org/15412/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dmtcs.episciences.org/15412/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025369365","display_name":"Lorenzo Balzotti","orcid":"https://orcid.org/0000-0001-6191-9801","observed_orcids":["https://orcid.org/0000-0001-6191-9801"]},"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":true,"raw_author_name":"Lorenzo Balzotti","raw_affiliation_strings":["Department of Statistical Sciences , Sapienza University of Rome , Rome , Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistical Sciences , Sapienza University of Rome , Rome , Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025369365"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08312449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"vol. 27:2","issue":"Discrete Algorithms","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.9984999895095825,"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.9984999895095825,"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.0010999999940395355,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/path-graphs","display_name":"path graphs","score":0.9980000257492065},{"id":"https://openalex.org/keywords/graph-recognition","display_name":"graph recognition","score":0.640999972820282},{"id":"https://openalex.org/keywords/intersection-graphs","display_name":"intersection graphs","score":0.7860000133514404},{"id":"https://openalex.org/keywords/directed-trees","display_name":"directed trees","score":0.6759999990463257},{"id":"https://openalex.org/keywords/graph-characterization","display_name":"graph characterization","score":0.4959999918937683},{"id":"https://openalex.org/keywords/recognition-algorithm","display_name":"recognition algorithm","score":0.4620000123977661}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7705460786819458},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6495460271835327},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5836087465286255},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46125826239585876},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.37041419744491577},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3435477614402771},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.21497341990470886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15376335382461548},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.46298/dmtcs.13355","doi":"https://doi.org/10.46298/dmtcs.13355","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.13355","pdf_url":"https://dmtcs.episciences.org/15412/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2012.08476","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2012.08476","pdf_url":"https://arxiv.org/pdf/2012.08476","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"raw_type":"text"},{"id":"pmh:oai:doaj.org/article:bdaba1e1f06640e6952009ec07d66d9c","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/bdaba1e1f06640e6952009ec07d66d9c","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science, Vol vol. 27:2, Iss Discrete Algorithms (2025)","raw_type":"article"},{"id":"doi:10.48550/arxiv.2012.08476","doi":"https://doi.org/10.48550/arxiv.2012.08476","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2012.08476","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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-journal"}],"best_oa_location":{"id":"doi:10.46298/dmtcs.13355","doi":"https://doi.org/10.46298/dmtcs.13355","is_oa":true,"landing_page_url":"https://doi.org/10.46298/dmtcs.13355","pdf_url":"https://dmtcs.episciences.org/15412/pdf","source":{"id":"https://openalex.org/S200334879","display_name":"Discrete Mathematics & Theoretical Computer Science","issn_l":"1365-8050","issn":["1365-8050","1462-7264"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4328141799","host_organization_name":"French association","host_organization_lineage":["https://openalex.org/P4328141799"],"host_organization_lineage_names":["French association"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics & Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4409983752.pdf","grobid_xml":"https://content.openalex.org/works/W4409983752.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W35535541","https://openalex.org/W1496800439","https://openalex.org/W1517921658","https://openalex.org/W1971080253","https://openalex.org/W1978452004","https://openalex.org/W1981750970","https://openalex.org/W1991477862","https://openalex.org/W1992093136","https://openalex.org/W1993412054","https://openalex.org/W2006621708","https://openalex.org/W2024491681","https://openalex.org/W2036751548","https://openalex.org/W2057556050","https://openalex.org/W2161426837","https://openalex.org/W2163619062","https://openalex.org/W2170633983","https://openalex.org/W4385222054","https://openalex.org/W6672082448"],"related_works":["https://openalex.org/W2016277208","https://openalex.org/W4283803822","https://openalex.org/W2028363955","https://openalex.org/W2183941833","https://openalex.org/W2132921321","https://openalex.org/W2065006817","https://openalex.org/W4394819403","https://openalex.org/W2031366744","https://openalex.org/W2129550502","https://openalex.org/W3120639636"],"abstract_inverted_index":{"A":[0,12],"path":[1,14,28,32,58,62,71,79],"graph":[2,6,15,19,48,101],"is":[3,16],"the":[4,17,52],"intersection":[5,18],"of":[7,20,70],"paths":[8,21],"in":[9,22],"a":[10,23,67],"tree.":[11,25],"directed":[13,24,31,61,78],"Even":[26],"if":[27],"graphs":[29,33,59],"and":[30,60,73,89,93],"are":[34],"characterized":[35],"very":[36],"similarly,":[37],"their":[38],"recognition":[39,54,97],"algorithms":[40,98],"differ":[41],"widely.":[42],"We":[43,64],"further":[44],"unify":[45],"these":[46],"two":[47],"classes":[49],"by":[50],"presenting":[51],"first":[53],"algorithm":[55,82],"for":[56,99],"both":[57,100],"graphs.":[63,80],"deeply":[65],"use":[66],"recent":[68],"characterization":[69],"graphs,":[72],"we":[74],"extend":[75],"it":[76],"to":[77],"Our":[81],"does":[83],"not":[84],"require":[85],"complex":[86],"data":[87],"structures":[88],"has":[90],"an":[91],"easy":[92],"intuitive":[94],"implementation,":[95],"simplifying":[96],"classes.":[102],"Comment:":[103],"13":[104],"pages,":[105],"3":[106],"figures":[107]},"counts_by_year":[],"updated_date":"2026-09-29T14:09:16.559479","created_date":"2025-10-10T00:00:00"}