{"id":"https://openalex.org/W7166585141","doi":"https://doi.org/10.48550/arxiv.2606.27451","title":"Totally Disjoint Diametral Paths","display_name":"Totally Disjoint Diametral Paths","publication_year":2026,"publication_date":"2026-06-25","ids":{"openalex":"https://openalex.org/W7166585141","doi":"https://doi.org/10.48550/arxiv.2606.27451"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.27451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.27451","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.27451","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011666437","display_name":"T\u0131naz Ekim","orcid":"https://orcid.org/0000-0002-1171-9294"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ekim, T\u0131naz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033239064","display_name":"Arthur Farley","orcid":"https://orcid.org/0000-0002-7162-8474"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Farley, Arthur","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.677299976348877,"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.677299976348877,"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.14239999651908875,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.03799999877810478,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/disjoint-sets","display_name":"Disjoint sets","score":0.8478999733924866},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4772999882698059},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4399000108242035},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4124000072479248},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.37709999084472656},{"id":"https://openalex.org/keywords/simple-graph","display_name":"Simple graph","score":0.3395000100135803},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.334199994802475},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3327000141143799}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8478999733924866},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8375999927520752},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7713000178337097},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5289999842643738},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4772999882698059},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4399000108242035},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4124000072479248},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.37709999084472656},{"id":"https://openalex.org/C2993105083","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Simple graph","level":3,"score":0.3395000100135803},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3327000141143799},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.3246999979019165},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.32190001010894775},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.30889999866485596},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.29670000076293945},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.28049999475479126},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.26969999074935913},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.2628999948501587},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.25529998540878296},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.2531999945640564}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.27451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.27451","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.27451","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.27451","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,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,130],"study":[4],"totally":[5,66,91,138],"disjoint":[6,39,67,92,139],"diametral":[7,14,68,93,140],"paths":[8,40,42,69,94,141],"in":[9,16,47],"simple":[10],"connected":[11],"graphs.":[12,128],"A":[13],"path":[15,22],"a":[17,20,61,88,101,105,114,122],"graph":[18,62],"is":[19,30,70,95],"shortest":[21],"that":[23,43,55],"connects":[24],"two":[25],"vertices":[26,46],"whose":[27],"mutual":[28],"distance":[29],"equal":[31],"to":[32],"the":[33,36,56,80,84,146],"diameter":[34],"of":[35,58,76,82,87,90,107,133,142,150],"graph.":[37],"Totally":[38],"are":[41],"have":[44],"no":[45],"common,":[48],"including":[49],"their":[50],"end":[51],"vertices.":[52],"We":[53,72,98],"show":[54],"problem":[57,81],"deciding":[59],"whether":[60],"$G$":[63],"has":[64],"$k$":[65,137],"NP-complete.":[71],"consider":[73],"restricted":[74],"classes":[75,132],"graphs":[77,110,135],"for":[78,104,117,125],"which":[79],"determining":[83],"maximum":[85],"size":[86],"set":[89],"readily":[96],"solved.":[97],"then":[99],"give":[100],"linear-time":[102],"algorithm":[103,116],"subclass":[106],"maximal":[108],"outerplanar":[109],"called":[111],"2-paths,":[112],"define":[113,131],"polynomial-time":[115],"threshold":[118],"graphs,":[119],"and":[120],"establish":[121],"structural":[123],"bound":[124],"proper":[126],"interval":[127],"Finally,":[129],"extremal":[134],"with":[136],"length":[143],"$d$":[144],"having":[145],"fewest":[147],"possible":[148],"number":[149],"edges.":[151]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-06-30T00:00:00"}