{"id":"https://openalex.org/W3021818218","doi":"https://doi.org/10.20532/cit.2019.1004754","title":"An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs","display_name":"An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs","publication_year":2020,"publication_date":"2020-05-07","ids":{"openalex":"https://openalex.org/W3021818218","doi":"https://doi.org/10.20532/cit.2019.1004754","mag":"3021818218"},"language":"en","primary_location":{"id":"doi:10.20532/cit.2019.1004754","is_oa":true,"landing_page_url":"https://doi.org/10.20532/cit.2019.1004754","pdf_url":"http://cit.fer.hr/index.php/CIT/article/download/4754/2292","source":{"id":"https://openalex.org/S98565333","display_name":"Journal of Computing and Information Technology","issn_l":"1330-1136","issn":["1330-1136","1846-3908"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310314807","host_organization_name":"Faculty of Electrical Engineering and Computing, University of Zagreb","host_organization_lineage":["https://openalex.org/P4310314807"],"host_organization_lineage_names":["Faculty of Electrical Engineering and Computing, University of Zagreb"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computing and Information Technology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://cit.fer.hr/index.php/CIT/article/download/4754/2292","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071637597","display_name":"Mehmet Hakan Karaata","orcid":"https://orcid.org/0000-0001-6654-8050"},"institutions":[{"id":"https://openalex.org/I36721946","display_name":"Kuwait University","ror":"https://ror.org/021e5j056","country_code":"KW","type":"education","lineage":["https://openalex.org/I36721946"]}],"countries":["KW"],"is_corresponding":true,"raw_author_name":"Mehmet Karaata","raw_affiliation_strings":["Department of Computer Engineering, Kuwait University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Kuwait University","institution_ids":["https://openalex.org/I36721946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5071637597"],"corresponding_institution_ids":["https://openalex.org/I36721946"],"apc_list":{"value":450,"currency":"EUR","value_usd":485},"apc_paid":{"value":450,"currency":"EUR","value_usd":485},"fwci":0.1458,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.5128829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"3","first_page":"1","last_page":"14"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9818999767303467,"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.9818999767303467,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9733999967575073,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.8682692050933838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7728523015975952},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6631737947463989},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5105836987495422},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48306208848953247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4741719961166382},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4499571621417999},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3740153908729553},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3580259680747986},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3382449150085449},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1847347617149353},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.0934637188911438}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.8682692050933838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7728523015975952},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6631737947463989},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5105836987495422},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48306208848953247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4741719961166382},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4499571621417999},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3740153908729553},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3580259680747986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3382449150085449},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1847347617149353},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0934637188911438},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.20532/cit.2019.1004754","is_oa":true,"landing_page_url":"https://doi.org/10.20532/cit.2019.1004754","pdf_url":"http://cit.fer.hr/index.php/CIT/article/download/4754/2292","source":{"id":"https://openalex.org/S98565333","display_name":"Journal of Computing and Information Technology","issn_l":"1330-1136","issn":["1330-1136","1846-3908"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310314807","host_organization_name":"Faculty of Electrical Engineering and Computing, University of Zagreb","host_organization_lineage":["https://openalex.org/P4310314807"],"host_organization_lineage_names":["Faculty of Electrical Engineering and Computing, University of Zagreb"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computing and Information Technology","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:ba1341f31f9a4522b40ece12eb4fa1b9","is_oa":true,"landing_page_url":"https://doaj.org/article/ba1341f31f9a4522b40ece12eb4fa1b9","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,"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":"Journal of Computing and Information Technology, Vol 27, Iss 3, Pp 1-14 (2019)","raw_type":"article"},{"id":"pmh:oai:hrcak.srce.hr:237989","is_oa":true,"landing_page_url":"https://hrcak.srce.hr/237989","pdf_url":null,"source":{"id":"https://openalex.org/S4306400071","display_name":"University of Zagreb University Computing Centre (SRCE)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181343428","host_organization_name":"University of Zagreb","host_organization_lineage":["https://openalex.org/I181343428"],"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":"Journal of computing and information technology","raw_type":"text"}],"best_oa_location":{"id":"doi:10.20532/cit.2019.1004754","is_oa":true,"landing_page_url":"https://doi.org/10.20532/cit.2019.1004754","pdf_url":"http://cit.fer.hr/index.php/CIT/article/download/4754/2292","source":{"id":"https://openalex.org/S98565333","display_name":"Journal of Computing and Information Technology","issn_l":"1330-1136","issn":["1330-1136","1846-3908"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310314807","host_organization_name":"Faculty of Electrical Engineering and Computing, University of Zagreb","host_organization_lineage":["https://openalex.org/P4310314807"],"host_organization_lineage_names":["Faculty of Electrical Engineering and Computing, University of Zagreb"],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computing and Information Technology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3021818218.pdf","grobid_xml":"https://content.openalex.org/works/W3021818218.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1551645481","https://openalex.org/W1596694105","https://openalex.org/W1958473923","https://openalex.org/W1968513681","https://openalex.org/W2011357658","https://openalex.org/W2039287103","https://openalex.org/W2040468540","https://openalex.org/W2073105533","https://openalex.org/W2091252880","https://openalex.org/W2102722785","https://openalex.org/W2105726668","https://openalex.org/W2114774964","https://openalex.org/W2116683188","https://openalex.org/W2146569905","https://openalex.org/W2154434560","https://openalex.org/W2155061423","https://openalex.org/W2158598102","https://openalex.org/W2162167488","https://openalex.org/W2754139490","https://openalex.org/W2766671930","https://openalex.org/W2885117938","https://openalex.org/W2905025382","https://openalex.org/W3138066533","https://openalex.org/W6646677405"],"related_works":["https://openalex.org/W2170725231","https://openalex.org/W2287258986","https://openalex.org/W4206261372","https://openalex.org/W2154434560","https://openalex.org/W3021818218","https://openalex.org/W4241786443","https://openalex.org/W2171208587","https://openalex.org/W2892546229","https://openalex.org/W2768149714","https://openalex.org/W2099123195"],"abstract_inverted_index":{"Given":[0],"two":[1,18,25,59],"distinct":[2],"vertices":[3],"(nodes)":[4],"source":[5],"s":[6,29,63],"and":[7,32,64,88,93],"target":[8],"t":[9,33,65],"of":[10,74,83,90],"a":[11,80],"graph":[12],"G":[13],"=":[14],"(V,":[15],"E),":[16],"the":[17,72],"node-disjoint":[19,26,39,60],"paths":[20,27,37,61],"problem":[21],"is":[22,71],"to":[23],"identify":[24],"between":[28,62],"\u2208":[30,34],"V":[31],"V.":[35],"Two":[36],"are":[38],"if":[40],"they":[41],"have":[42],"no":[43],"common":[44],"intermediate":[45],"vertices.":[46],"In":[47],"this":[48],"paper,":[49],"we":[50],"present":[51],"an":[52],"algorithm":[53,78],"with":[54],"O(m)-time":[55],"complexity":[56],"for":[57],"finding":[58],"in":[66,85],"arbitrary":[67],"graphs":[68],"where":[69],"m":[70],"number":[73],"edges.":[75],"The":[76],"proposed":[77],"has":[79],"wide":[81],"range":[82],"applications":[84],"ensuring":[86],"reliability":[87],"security":[89],"sensor,":[91],"mobile":[92],"fixed":[94],"communication":[95],"networks.":[96]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}