{"id":"https://openalex.org/W4308616793","doi":"https://doi.org/10.1142/s0129054122500241","title":"Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults","display_name":"Paired 3-Disjoint Path Covers in Bipartite Torus-Like Graphs with Edge Faults","publication_year":2022,"publication_date":"2022-11-09","ids":{"openalex":"https://openalex.org/W4308616793","doi":"https://doi.org/10.1142/s0129054122500241"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054122500241","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122500241","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"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/A5053644047","display_name":"Jung-Heum Park","orcid":"https://orcid.org/0000-0002-1052-5746"},"institutions":[{"id":"https://openalex.org/I87111246","display_name":"Catholic University of Korea","ror":"https://ror.org/01fpnj063","country_code":"KR","type":"education","lineage":["https://openalex.org/I87111246"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Jung-Heum Park","raw_affiliation_strings":["School of Computer Science and Information Engineering, The Catholic University of Korea, Republic of Korea"],"affiliations":[{"raw_affiliation_string":"School of Computer Science and Information Engineering, The Catholic University of Korea, Republic of Korea","institution_ids":["https://openalex.org/I87111246"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053644047"],"corresponding_institution_ids":["https://openalex.org/I87111246"],"apc_list":null,"apc_paid":null,"fwci":0.6903,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71455057,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"34","issue":"04","first_page":"429","last_page":"441"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9753999710083008,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8217465877532959},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.7599338293075562},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.755577802658081},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6498727202415466},{"id":"https://openalex.org/keywords/torus","display_name":"Torus","score":0.5621079802513123},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5213987827301025},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4939141869544983},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4775325059890747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46366220712661743},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.44318148493766785},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37861546874046326},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.152614563703537},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11967840790748596}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8217465877532959},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.7599338293075562},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.755577802658081},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6498727202415466},{"id":"https://openalex.org/C9767117","wikidata":"https://www.wikidata.org/wiki/Q12510","display_name":"Torus","level":2,"score":0.5621079802513123},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5213987827301025},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4939141869544983},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4775325059890747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46366220712661743},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.44318148493766785},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37861546874046326},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.152614563703537},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11967840790748596},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"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/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054122500241","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054122500241","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1521484408","display_name":null,"funder_award_id":"2021R1F1A1048180","funder_id":"https://openalex.org/F4320322120","funder_display_name":"National Research Foundation of Korea"}],"funders":[{"id":"https://openalex.org/F4320322120","display_name":"National Research Foundation of Korea","ror":"https://ror.org/013aysd81"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W574738980","https://openalex.org/W1497740629","https://openalex.org/W1813111821","https://openalex.org/W2023957019","https://openalex.org/W2057052228","https://openalex.org/W2101150428","https://openalex.org/W2146715579","https://openalex.org/W2162674041","https://openalex.org/W2170432635","https://openalex.org/W2527919477","https://openalex.org/W2537806258","https://openalex.org/W2600917856","https://openalex.org/W2772936786","https://openalex.org/W2895094344","https://openalex.org/W2896810482","https://openalex.org/W2963978241","https://openalex.org/W3023551501","https://openalex.org/W3091802786","https://openalex.org/W3202701024","https://openalex.org/W4213300919"],"related_works":["https://openalex.org/W2091826982","https://openalex.org/W2036057584","https://openalex.org/W2107875203","https://openalex.org/W245205139","https://openalex.org/W2921162226","https://openalex.org/W4234658180","https://openalex.org/W4235849992","https://openalex.org/W4246000090","https://openalex.org/W3143578817","https://openalex.org/W2910933086"],"abstract_inverted_index":{"Given":[0],"two":[1],"disjoint":[2,121],"vertex-sets,":[3],"[Formula:":[4,8,17,23,27,37,52,57,61,94,99,105,114,123,127,132,138],"see":[5,9,18,24,28,38,53,58,62,95,100,106,115,124,128,133,139],"text]":[6,10,25,29,39,54,59,107,125,129,134,140],"and":[7,26,126],"in":[11,48],"a":[12,14,31,70,91,111],"graph,":[13,47,73],"paired":[15,112],"many-to-many":[16,113],"text]-disjoint":[19,116],"path":[20,51,117],"cover":[21,42,118],"joining":[22,119],"is":[30],"set":[32],"of":[33,45,130,145,150],"pairwise":[34],"vertex-disjoint":[35],"paths":[36],"that":[40,69,81,137],"altogether":[41],"every":[43],"vertex":[44],"the":[46,142,151],"which":[49],"each":[50,135],"runs":[55],"from":[56,76,147],"to":[60],"text].":[63],"In":[64],"this":[65],"paper,":[66],"we":[67],"reveal":[68],"bipartite":[71,97],"torus-like":[72,79],"if":[74],"built":[75],"lower":[77],"dimensional":[78],"graphs":[80],"have":[82],"good":[83,88],"disjoint-path-cover":[84],"properties,":[85],"retain":[86],"such":[87,136],"property.":[89],"As":[90],"result,":[92],"an":[93],"text]-dimensional":[96],"torus,":[98],"text],":[101],"with":[102],"at":[103],"most":[104],"edge":[108],"faults":[109],"has":[110],"arbitrary":[120],"sets":[122],"size":[131],"contains":[141],"equal":[143],"numbers":[144],"vertices":[146],"different":[148],"parts":[149],"bipartition.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}