{"id":"https://openalex.org/W4244732212","doi":"https://doi.org/10.1137/1.9781611974331.ch131","title":"Natural Algorithms for Flow Problems","display_name":"Natural Algorithms for Flow Problems","publication_year":2015,"publication_date":"2015-12-21","ids":{"openalex":"https://openalex.org/W4244732212","doi":"https://doi.org/10.1137/1.9781611974331.ch131"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch131","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch131","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"proceedings-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch131","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019340639","display_name":"Damian Straszak","orcid":"https://orcid.org/0000-0003-4013-2270"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Damian Straszak","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5063089732","display_name":"Nisheeth K. Vishnoi","orcid":"https://orcid.org/0000-0002-0255-1119"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nisheeth K. Vishnoi","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.617,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":28,"citation_normalized_percentile":{"value":0.682233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T13362","display_name":"Slime Mold and Myxomycetes Research","score":0.9999,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T12536","display_name":"Topological and Geometric Data Analysis","score":0.9475,"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/physarum","display_name":"Physarum","score":0.7905608},{"id":"https://openalex.org/keywords/slime-mold","display_name":"Slime Mold","score":0.61913717}],"concepts":[{"id":"https://openalex.org/C2780855919","wikidata":"https://www.wikidata.org/wiki/Q134950","display_name":"Physarum polycephalum","level":2,"score":0.9387381},{"id":"https://openalex.org/C2778153493","wikidata":"https://www.wikidata.org/wiki/Q289636","display_name":"Physarum","level":3,"score":0.7905608},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7361169},{"id":"https://openalex.org/C33682779","wikidata":"https://www.wikidata.org/wiki/Q949817","display_name":"Slime mold","level":2,"score":0.61913717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6182989},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5486468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48178598},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.43997294},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43000782},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41481784},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40764242},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37531802},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3436553},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C95444343","wikidata":"https://www.wikidata.org/wiki/Q7141","display_name":"Cell biology","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":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch131","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch131","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1137/1.9781611974331.ch131","pdf_url":"https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch131","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W763136573","https://openalex.org/W4299929983","https://openalex.org/W2964239299","https://openalex.org/W2769697016","https://openalex.org/W2737068321","https://openalex.org/W2483646289","https://openalex.org/W2274750299","https://openalex.org/W2109063077","https://openalex.org/W1537994744","https://openalex.org/W132544618"],"abstract_inverted_index":{"In":[0,114],"the":[1,12,41,99,103,124,132,152,166],"last":[2],"few":[3],"years,":[4],"there":[5],"has":[6],"been":[7],"a":[8,24,37,49,73,80,87,172],"significant":[9],"interest":[10],"in":[11,36],"computational":[13,169],"abilities":[14],"of":[15,43,83,147,165],"Physarum":[16,44,100],"polycephalum":[17],"(a":[18],"slime":[19],"mold).":[20],"This":[21,150],"arose":[22],"from":[23],"remarkable":[25],"experiment":[26],"which":[27],"showed":[28],"that":[29,98,123,143,155,161],"this":[30,56,91,115,119],"organism":[31],"can":[32,128],"compute":[33],"shortest":[34,65,104,148],"paths":[35],"maze":[38],"[10].":[39],"Subsequently,":[40],"workings":[42],"were":[45,58],"mathematically":[46],"modeled":[47],"as":[48],"dynamical":[50],"system":[51],"and":[52,68,86,139],"algorithms":[53,160],"inspired":[54],"by":[55,94],"model":[57],"proposed":[59],"to":[60,71],"solve":[61,131,163],"several":[62],"graph":[63],"problems:":[64],"paths,":[66],"flows,":[67],"linear":[69],"programs":[70],"name":[72],"few.":[74],"Indeed,":[75],"computer":[76],"scientists":[77],"have":[78],"initiated":[79],"rigorous":[81],"study":[82],"these":[84],"dynamics":[85,101],"first":[88],"step":[89],"towards":[90],"was":[92],"taken":[93],"[1,2]":[95],"who":[96],"proved":[97],"for":[102],"path":[105],"problem":[106],"are":[107,111,144],"efficient":[108],"(when":[109],"edge-lengths":[110],"polynomially":[112],"bounded).":[113],"paper,":[116],"we":[117,121,176],"take":[118],"further:":[120],"prove":[122],"discrete":[125],"time":[126],"Physarum-dynamics":[127],"also":[129],"efficiently":[130,162],"uncapacitated":[133],"mincost":[134],"flow":[135],"problems":[136,142],"on":[137],"undirected":[138],"directed":[140],"graphs;":[141],"non-trivial":[145],"generalizations":[146],"path.":[149],"raises":[151],"tantalizing":[153],"possibility":[154],"nature,":[156],"via":[157],"evolution,":[158],"developed":[159],"some":[164],"most":[167],"complex":[168],"problems,":[170],"about":[171],"billion":[173],"years":[174],"before":[175],"did.":[177]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W4244732212","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":21},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-01-20T09:07:44.690150","created_date":"2022-05-12"}