{"id":"https://openalex.org/W2069977975","doi":null,"title":"Parallel processing for some network optimization problems","display_name":"Parallel processing for some network optimization problems","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W2069977975","mag":"2069977975"},"language":"en","primary_location":{"id":"mag:2069977975","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=911112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5055580259","display_name":"Year Back Yoo","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Year Back Yoo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5055580259"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.04,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68975904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9937000274658203,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.0034000000450760126,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.0015999999595806003,"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/parallel-algorithms","display_name":"parallel algorithms","score":0.9990000128746033},{"id":"https://openalex.org/keywords/network-optimization","display_name":"network optimization","score":0.9190000295639038},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"minimum spanning tree","score":0.921999990940094},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.9929999709129333},{"id":"https://openalex.org/keywords/minimum-cost-flow","display_name":"minimum cost flow","score":0.9990000128746033},{"id":"https://openalex.org/keywords/parallel-data-structures","display_name":"parallel data structures","score":0.6940000057220459},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"parallel computing","score":0.527999997138977}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7793936729431152},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.7661533951759338},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6671410799026489},{"id":"https://openalex.org/C126909462","wikidata":"https://www.wikidata.org/wiki/Q5369501","display_name":"Embarrassingly parallel","level":3,"score":0.6312844753265381},{"id":"https://openalex.org/C106515295","wikidata":"https://www.wikidata.org/wiki/Q26806595","display_name":"Parallel processing","level":2,"score":0.5952115654945374},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5901897549629211},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.5805401802062988},{"id":"https://openalex.org/C156891508","wikidata":"https://www.wikidata.org/wiki/Q1004114","display_name":"Bulk synchronous parallel","level":3,"score":0.5232017040252686},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.51123046875},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4488169252872467},{"id":"https://openalex.org/C11644782","wikidata":"https://www.wikidata.org/wiki/Q15401790","display_name":"Cost efficiency","level":2,"score":0.4218444228172302},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.42131534218788147},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3508235216140747},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3445179760456085},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14528131484985352},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.13705182075500488},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2069977975","doi":null,"is_oa":false,"landing_page_url":"http://dl.acm.org/citation.cfm?id=911112","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W645562817","https://openalex.org/W1488595466","https://openalex.org/W2106960349","https://openalex.org/W152304962","https://openalex.org/W1990039347","https://openalex.org/W2010191164","https://openalex.org/W7096683136","https://openalex.org/W2530917052","https://openalex.org/W2029058995","https://openalex.org/W1585599370"],"abstract_inverted_index":{"Parallel":[0,84],"processing":[1],"is":[2],"a":[3,55,117],"new":[4],"area":[5],"of":[6,17,26,31,42,49,58,105],"computer":[7,115,119],"science":[8],"which":[9],"has":[10,20],"evolved":[11],"in":[12,23,35],"the":[13,24,36,39,47,89],"recent":[14],"years.":[15],"Development":[16],"parallel":[18,27,32,43,51,59,65,114,118],"computers":[19,44],"increased":[21],"interest":[22],"study":[25],"algorithms.":[28,52],"The":[29],"importance":[30],"algorithms":[33,60,66,85,107],"lies":[34],"fact":[37],"that":[38],"widespread":[40],"use":[41],"depends":[45],"on":[46,111],"availability":[48],"efficient":[50],"There":[53],"are":[54,70,82,86],"large":[56],"number":[57,131,139],"for":[61,67,88],"numerical":[62],"problems,":[63],"but":[64],"nonnumerical":[68],"problems":[69],"rare.\r\nIn":[71],"this":[72],"dissertation":[73],"some":[74],"techniques":[75],"and":[76,100,133],"data":[77],"structures":[78],"to":[79],"exploit":[80],"parallelism":[81],"categorized.":[83],"designed":[87],"following":[90],"problems:":[91],"minimum":[92,101],"spanning":[93],"tree,":[94],"one-to-all":[95],"shortest":[96],"path,":[97],"maximum":[98],"flow,":[99],"cost":[102],"flow.":[103],"Most":[104],"the\r\nparallel":[106],"have":[108],"been":[109],"implemented":[110],"an":[112],"actual":[113],"and/or":[116],"simulator.\r\n('+)This":[120],"work":[121],"was":[122],"partially":[123],"supported":[124],"by":[125],"U.S.":[126],"Army":[127],"Research":[128],"Office":[129],"grant":[130,138],"DAAG-82-K-0107":[132],"National":[134],"Science":[135],"Foundation":[136],"equipment":[137],"MCS-8203868.":[140]},"counts_by_year":[],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}