{"id":"https://openalex.org/W28690820","doi":"https://doi.org/10.1142/s0129626499000475","title":"PARALLEL ALGORITHMS FOR LONGEST INCREASING CHAINS IN THE PLANE AND RELATED PROBLEMS","display_name":"PARALLEL ALGORITHMS FOR LONGEST INCREASING CHAINS IN THE PLANE AND RELATED PROBLEMS","publication_year":1999,"publication_date":"1999-12-01","ids":{"openalex":"https://openalex.org/W28690820","doi":"https://doi.org/10.1142/s0129626499000475","mag":"28690820"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626499000475","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000475","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","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/A5113562454","display_name":"Mikhail J. Atallah","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"MIKHAIL J. ATALLAH","raw_affiliation_strings":["Dept. of Computer Sciences, Purdue University, West Lafayette,  IN 47907, USA","Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Sciences, Purdue University, West Lafayette,  IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]},{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN 47907, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060901632","display_name":"Danny Z. Chen","orcid":"https://orcid.org/0000-0001-6565-2884"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"DANNY Z. CHEN","raw_affiliation_strings":["Dept. of Computer Science and Engineering, University of  Notre Dame, Notre Dame, IN 46556-5637, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, University of  Notre Dame, Notre Dame, IN 46556-5637, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069224332","display_name":"Kevin S. Klenk","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"KEVIN S. KLENK","raw_affiliation_strings":["Dept. of Computer Science and Engineering, University of  Notre Dame, Notre Dame, IN 46556-5637, USA"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science and Engineering, University of  Notre Dame, Notre Dame, IN 46556-5637, USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113562454"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.347,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60875912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"09","issue":"04","first_page":"511","last_page":"520"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9829000234603882,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9509999752044678,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/computer-science","display_name":"Computer science","score":0.655382513999939},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6361255645751953},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.6224575042724609},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5850046277046204},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5299319624900818},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.520056426525116},{"id":"https://openalex.org/keywords/crew","display_name":"Crew","score":0.49738696217536926},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47509825229644775},{"id":"https://openalex.org/keywords/planar","display_name":"Planar","score":0.4634888470172882},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4477458596229553},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43491923809051514},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4184942841529846},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4158822000026703},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2683337926864624},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2616084814071655}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.655382513999939},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6361255645751953},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.6224575042724609},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5850046277046204},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5299319624900818},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.520056426525116},{"id":"https://openalex.org/C2780179797","wikidata":"https://www.wikidata.org/wiki/Q345844","display_name":"Crew","level":2,"score":0.49738696217536926},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47509825229644775},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.4634888470172882},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4477458596229553},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43491923809051514},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4184942841529846},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4158822000026703},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2683337926864624},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2616084814071655},{"id":"https://openalex.org/C121684516","wikidata":"https://www.wikidata.org/wiki/Q7600677","display_name":"Computer graphics (images)","level":1,"score":0.0},{"id":"https://openalex.org/C178802073","wikidata":"https://www.wikidata.org/wiki/Q8421","display_name":"Aeronautics","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s0129626499000475","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626499000475","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"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":"Parallel Processing Letters","raw_type":"journal-article"},{"id":"mag:28690820","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/cccg/cccg1997.html#AtallahCK97","pdf_url":null,"source":{"id":"https://openalex.org/S4306417878","display_name":"Canadian Conference on Computational Geometry","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Canadian Conference on Computational Geometry","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1966224002","https://openalex.org/W2024244897","https://openalex.org/W2027428596","https://openalex.org/W2031251427","https://openalex.org/W2033740214","https://openalex.org/W2038796709","https://openalex.org/W2056711744","https://openalex.org/W2096827683","https://openalex.org/W2135436879","https://openalex.org/W2169097015"],"related_works":["https://openalex.org/W2169097015","https://openalex.org/W2106884141","https://openalex.org/W2078117779","https://openalex.org/W1568336836","https://openalex.org/W1981326876","https://openalex.org/W1722200543","https://openalex.org/W1570283814","https://openalex.org/W2093098653","https://openalex.org/W2085059707","https://openalex.org/W1887778146","https://openalex.org/W2081276579","https://openalex.org/W2146832545","https://openalex.org/W1608198357","https://openalex.org/W1971715758","https://openalex.org/W1599388741","https://openalex.org/W103414098","https://openalex.org/W2146189710","https://openalex.org/W636467641","https://openalex.org/W2065159944","https://openalex.org/W1526090355"],"abstract_inverted_index":{"Given":[0],"a":[1,23,47,60,92],"set":[2],"[Formula:":[3,17,41,74,79,108,113],"see":[4,18,42,75,80,109,114],"text]":[5,19,43,76,81,110,115],"of":[6,30,49,95,120],"n":[7],"points":[8,39],"in":[9,16,40,70,73,83,101,107],"the":[10,28,32,38,50,65,71,84,97,127],"plane":[11,72],"such":[12],"that":[13,63],"each":[14],"point":[15],"is":[20,46],"asscociated":[21],"with":[22],"nonnegative":[24],"weight,":[25],"we":[26,58],"consider":[27],"problem":[29,45,94],"computing":[31,96],"single-source":[33,66],"longest":[34,67,99],"increasing":[35],"chains":[36,69],"among":[37],"This":[44],"generalization":[48],"plannar":[51],"maximal":[52],"layers":[53],"problem.":[54],"In":[55],"this":[56],"paper,":[57],"present":[59],"parallel":[61,122],"algorithm":[62],"computes":[64],"incresing":[68],"time":[77,111],"using":[78,112],"processors":[82],"CREW":[85,116],"PRAM":[86,117],"computational":[87],"model.":[88],"We":[89],"also":[90],"solve":[91],"related":[93],"all-pairs":[98],"paths":[100],"an":[102],"n-node":[103],"weighted":[104],"planar":[105],"st-graph,":[106],"processors.":[118],"Both":[119],"our":[121],"algorithms":[123],"are":[124],"improvement":[125],"over":[126],"previously":[128],"best":[129],"known":[130],"results.":[131]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}