{"id":"https://openalex.org/W2148691049","doi":"https://doi.org/10.1137/0220022","title":"Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs","display_name":"Efficient Parallel Algorithms for Testing<i>k</i>and Finding Disjoint<i>s</i>-<i>t</i>Paths in Graphs","publication_year":1991,"publication_date":"1991-04-01","ids":{"openalex":"https://openalex.org/W2148691049","doi":"https://doi.org/10.1137/0220022","mag":"2148691049"},"language":"en","primary_location":{"id":"doi:10.1137/0220022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220022","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5042716179","display_name":"Samir Khuller","orcid":"https://orcid.org/0000-0002-5408-8023"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samir Khuller","raw_affiliation_strings":["cornell University"],"affiliations":[{"raw_affiliation_string":"cornell University","institution_ids":["https://openalex.org/I205783295"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089964489","display_name":"Baruch Schieber","orcid":null},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Baruch Schieber","raw_affiliation_strings":["cornell University"],"affiliations":[{"raw_affiliation_string":"cornell University","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042716179"],"corresponding_institution_ids":["https://openalex.org/I205783295"],"apc_list":null,"apc_paid":null,"fwci":3.3829,"has_fulltext":false,"cited_by_count":26,"citation_normalized_percentile":{"value":0.93259152,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"2","first_page":"352","last_page":"375"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9973000288009644,"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"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9973000288009644,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9972000122070312,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9970999956130981,"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.5808295011520386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5322226285934448},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43347740173339844},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42995262145996094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31040751934051514}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5808295011520386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5322226285934448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43347740173339844},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42995262145996094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31040751934051514}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0220022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0220022","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1525833494","https://openalex.org/W1585069742","https://openalex.org/W1586466644","https://openalex.org/W1607171523","https://openalex.org/W1976285925","https://openalex.org/W1986022261","https://openalex.org/W1995040285","https://openalex.org/W2001004241","https://openalex.org/W2004350101","https://openalex.org/W2008292658","https://openalex.org/W2009349792","https://openalex.org/W2035435951","https://openalex.org/W2045426033","https://openalex.org/W2048838677","https://openalex.org/W2061303458","https://openalex.org/W2087489294","https://openalex.org/W2091252880","https://openalex.org/W2121765622","https://openalex.org/W2143462372","https://openalex.org/W2577446513","https://openalex.org/W4213214460"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W1979597421","https://openalex.org/W1971174658","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W4225152035","https://openalex.org/W2099195351","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819"],"abstract_inverted_index":{"An":[0],"efficient":[1,83,172],"parallel":[2,84,138,173],"algorithm":[3,16,69,85,139,158,174,185,208],"for":[4,88,140,175],"testing":[5,176],"whether":[6,177],"a":[7,31,96,124,178,197],"graph":[8,97,179],"G":[9,61,180],"is":[10,13,49,86,167,181],"k-vertex":[11],"connected":[12,58],"presented.":[14],"The":[15,137,153,184],"runs":[17,70,143,186],"in":[18,62,71,144,187],"$O(k^2":[19,145,188],"\\log":[20,146,189],"n)$":[21,147,190],"time":[22,73,148,191],"and":[23,36,43,47,74,99,104,113,135,149,192],"uses":[24,75,150,193],"$(n":[25],"+":[26],"k^2":[27],")kC(n,m)$":[28],"processors":[29,53,195],"on":[30,196],"CROW":[32,198],"PRAM,":[33],"where":[34],"n":[35],"m":[37],"are":[38,209],"the":[39,50,57,68,89,157,204],"number":[40,51],"of":[41,45,52,60,126,203],"vertices":[42,102,130],"edges":[44],"G,":[46,98],"$C(n,m)$":[48],"required":[54],"to":[55,155,159],"compute":[56],"components":[59],"logarithmic":[63,72],"time.":[64],"For":[65],"fixed":[66],"k,":[67],"$nC(n,m)$":[76],"processors.":[77,152],"To":[78],"develop":[79],"our":[80],"algorithm,":[81],"an":[82,171],"designed":[87],"following":[90],"disjoint":[91,109,162,205],"s-t":[92,206],"paths":[93,110,121,207],"problem.":[94],"Given":[95],"two":[100],"specified":[101],"s":[103,112,134],"t,":[105,114],"find":[106,123,160],"k":[107],"vertex":[108],"between":[111],"if":[115,164],"they":[116,165],"exist.":[117],"If":[118],"no":[119],"such":[120],"exist,":[122,166],"set":[125],"at":[127],"most":[128],"$k-1$":[129],"whose":[131],"removal":[132],"disconnects":[133],"t.":[136],"this":[141],"problem":[142],"$kC(n,m)$":[151],"way":[154],"modify":[156],"k-edge":[161,182],"paths,":[163],"shown.":[168],"This":[169],"yields":[170],"connected.":[183],"$nkC(n,kn)$":[194],"PRAM.":[199],"Finally,":[200],"more":[201],"applications":[202],"described.":[210]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}