{"id":"https://openalex.org/W2049188514","doi":"https://doi.org/10.1016/j.tcs.2011.05.017","title":"Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time","display_name":"Counting and sampling minimum (s,t)-cuts in weighted planar graphs in polynomial time","publication_year":2012,"publication_date":"2012-02-01","ids":{"openalex":"https://openalex.org/W2049188514","doi":"https://doi.org/10.1016/j.tcs.2011.05.017","mag":"2049188514"},"language":"en","primary_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2011.05.017","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["1879-2294","0304-3975"],"is_oa":false,"is_in_doaj":false,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"publisher-specific-oa","version":"publishedVersion","is_accepted":true,"is_published":true},"type":"article","type_crossref":"journal-article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2011.05.017","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055688854","display_name":"Ivona Bez\u00e1kov\u00e1","orcid":"https://orcid.org/0000-0002-8966-5396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ivona Bez\u00e1kov\u00e1","raw_affiliation_string":"","raw_affiliation_strings":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5052980409","display_name":"Adam J. Friedlander","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Adam J. Friedlander","raw_affiliation_string":"","raw_affiliation_strings":[]}],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2690,"currency":"USD","value_usd":2690,"provenance":"doaj"},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690,"provenance":"doaj"},"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":11,"cited_by_percentile_year":{"min":88,"max":89},"biblio":{"volume":"417","issue":null,"first_page":"2","last_page":"11"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Mesh Generation Algorithms","score":0.9979,"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":"Mesh Generation Algorithms","score":0.9979,"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/T10720","display_name":"Combinatorial Optimization and Complexity Theory","score":0.9972,"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/T12288","display_name":"Distributed Coordination in Online Robotics Research","score":0.9953,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"keyword":"planar graphs","score":0.5538},{"keyword":"sampling","score":0.4089}],"concepts":[{"id":"https://openalex.org/C2781324535","wikidata":"https://www.wikidata.org/wiki/Q720106","display_name":"Scroll","level":2,"score":0.58419263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4827025},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4520483},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38805354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33972389},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.09379578},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","level":1,"score":0.07893476},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.05263716},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2011.05.017","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["1879-2294","0304-3975"],"is_oa":false,"is_in_doaj":false,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"publisher-specific-oa","version":"publishedVersion","is_accepted":true,"is_published":true}],"best_oa_location":{"is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2011.05.017","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["1879-2294","0304-3975"],"is_oa":false,"is_in_doaj":false,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"publisher-specific-oa","version":"publishedVersion","is_accepted":true,"is_published":true},"sustainable_development_goals":[],"grants":[],"referenced_works_count":15,"referenced_works":["https://openalex.org/W1987374783","https://openalex.org/W1998076865","https://openalex.org/W2008597108","https://openalex.org/W2009879748","https://openalex.org/W2014682451","https://openalex.org/W2039086323","https://openalex.org/W2042322483","https://openalex.org/W2068595367","https://openalex.org/W2090359754","https://openalex.org/W2102883744","https://openalex.org/W2119300483","https://openalex.org/W2159332695","https://openalex.org/W2169621137","https://openalex.org/W3111890340","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2899084033","https://openalex.org/W2130001076","https://openalex.org/W2078213345","https://openalex.org/W2389268081","https://openalex.org/W2022161681","https://openalex.org/W2131673291","https://openalex.org/W2085287906","https://openalex.org/W2010065324","https://openalex.org/W3195058979"],"ngrams_url":"https://api.openalex.org/works/W2049188514/ngrams","abstract_inverted_index":{"We":[0],"give":[1],"an":[2],"O":[3],"(":[4,18],"n":[5,8,10,29],"d":[6,36],"+":[7],"log":[9],")":[11,22],"algorithm":[12,59],"computing":[13],"the":[14,31,38,41,48,71],"number":[15,32],"of":[16,33,40,80],"minimum":[17],"s":[19,43,66,81],",":[20],"t":[21,45,68,83],"-cuts":[23],"in":[24,47,91],"weighted":[25,85],"planar":[26,62],"graphs,":[27,86],"where":[28],"is":[30,37],"vertices":[34],"and":[35,54,67,82,84,87],"length":[39],"shortest":[42],"\u2013":[44],"path":[46],"corresponding":[49],"unweighted":[50,61],"graph.":[51],"Previously,":[52],"Ball":[53],"Provan":[55],"gave":[56],"a":[57],"polynomial-time":[58],"for":[60,77],"graphs":[63],"with":[64],"both":[65],"lying":[69],"on":[70],"outer":[72],"face.":[73],"Our":[74],"results":[75],"hold":[76],"all":[78],"locations":[79],"have":[88],"direct":[89],"applications":[90],"computer":[92],"vision.":[93]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2049188514","counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2024-02-22T19:21:29.397703","created_date":"2016-06-24"}