乐胖代购免代理版

{"id":"https://openalex.org/W2008597108","doi":"https://doi.org/10.1145/1502793.1502798","title":"An O ( n log n ) algorithm for maximum st -flow in a directed planar graph","display_name":"An O ( n log n ) algorithm for maximum st -flow in a directed planar graph","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2008597108","doi":"https://doi.org/10.1145/1502793.1502798","mag":"2008597108"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/1502793.1502798","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5108529502","display_name":"Glencora Borradaile","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"funder","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Glencora Borradaile","raw_affiliation_strings":["Brown University Providence, Rhode Island."],"affiliations":[{"raw_affiliation_string":"Brown University Providence, Rhode Island.","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"funder","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Philip Klein","raw_affiliation_strings":["Brown University Providence, Rhode Island."],"affiliations":[{"raw_affiliation_string":"Brown University Providence, Rhode Island.","institution_ids":["https://openalex.org/I27804330"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.627,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":90,"citation_normalized_percentile":{"value":0.975829,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"56","issue":"2","first_page":"1","last_page":"30"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.998,"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.998,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9972,"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/T11106","display_name":"Data Management and Algorithms","score":0.9915,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/maximum-flow-problem","display_name":"Maximum flow problem","score":0.6784512}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.6784512},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.6534904},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6355861},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6018006},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5527684},{"id":"https://openalex.org/C134786449","wikidata":"https://www.wikidata.org/wiki/Q3391255","display_name":"Planar","level":2,"score":0.54517454},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.540979},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.53721046},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5303092},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5142886},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.50228024},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.49025017},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4243526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3436265},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3130417},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07390922},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/1502793.1502798","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_indexed_in_scopus":true,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[{"funder":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations","award_id":"CCF-0635089"}],"datasets":[],"versions":[],"referenced_works_count":35,"referenced_works":["https://openalex.org/W1498660721","https://openalex.org/W1969523663","https://openalex.org/W1977155699","https://openalex.org/W1987197912","https://openalex.org/W1990488650","https://openalex.org/W1992869351","https://openalex.org/W1995229611","https://openalex.org/W2002531683","https://openalex.org/W2007918837","https://openalex.org/W2018804864","https://openalex.org/W2022980325","https://openalex.org/W2024798104","https://openalex.org/W2034509988","https://openalex.org/W2039086323","https://openalex.org/W2045729188","https://openalex.org/W2054014036","https://openalex.org/W2068595367","https://openalex.org/W2070505654","https://openalex.org/W2078443814","https://openalex.org/W2090359754","https://openalex.org/W2099463627","https://openalex.org/W2120424341","https://openalex.org/W2138560648","https://openalex.org/W2141824346","https://openalex.org/W2149342630","https://openalex.org/W2154501376","https://openalex.org/W2159388712","https://openalex.org/W2395343391","https://openalex.org/W2561675875","https://openalex.org/W2762935521","https://openalex.org/W3014094413","https://openalex.org/W4213060883","https://openalex.org/W4243580053","https://openalex.org/W58570057","https://openalex.org/W75740688"],"related_works":["https://openalex.org/W2766237626","https://openalex.org/W2379764279","https://openalex.org/W2372895815","https://openalex.org/W2366583813","https://openalex.org/W2360924501","https://openalex.org/W2349474539","https://openalex.org/W2167833628","https://openalex.org/W2089521921","https://openalex.org/W2012334499","https://openalex.org/W1581300568"],"abstract_inverted_index":{"We":[0],"give":[1],"the":[2,35,37,43],"first":[3],"correct":[4],"O":[5],"(":[6],"n":[7,9],"log":[8],")":[10],"algorithm":[11,38],"for":[12],"finding":[13,30],"a":[14,19,24],"maximum":[15],"st":[16],"-flow":[17],"in":[18,29,34],"directed":[20],"planar":[21],"graph.":[22],"After":[23],"preprocessing":[25],"step":[26],"that":[27],"consists":[28,39],"single-source":[31],"shortest-path":[32],"distances":[33],"dual,":[36],"of":[40],"repeatedly":[41],"saturating":[42],"leftmost":[44],"residual":[45],"s":[46],"-to-":[47],"t":[48],"path.":[49]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2008597108","counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":12},{"year":2012,"cited_by_count":7}],"updated_date":"2025-03-22T09:33:29.179189","created_date":"2016-06-24"}