{"id":"https://openalex.org/W2013440902","doi":"https://doi.org/10.1145/2612669.2612728","title":"A distributed perspective on graph connectivity and cuts","display_name":"A distributed perspective on graph connectivity and cuts","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2013440902","doi":"https://doi.org/10.1145/2612669.2612728","mag":"2013440902"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612728","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-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/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5023808567"],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10780598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9962000250816345,"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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9962000250816345,"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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9937999844551086,"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"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.992900013923645,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.725125789642334},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.7005507946014404},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5798514485359192},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5789692401885986},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5048158764839172},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5006637573242188},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.47521668672561646},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4444800019264221},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33964642882347107},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.30833953619003296},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1442973017692566}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.725125789642334},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7005507946014404},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5798514485359192},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5789692401885986},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5048158764839172},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5006637573242188},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.47521668672561646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4444800019264221},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33964642882347107},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.30833953619003296},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1442973017692566},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2612669.2612728","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612728","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W17155033","https://openalex.org/W3207760230","https://openalex.org/W1496222301","https://openalex.org/W4312814274","https://openalex.org/W1590307681","https://openalex.org/W2536018345","https://openalex.org/W4285370786","https://openalex.org/W2296488620","https://openalex.org/W2358353312","https://openalex.org/W2353836703"],"abstract_inverted_index":{"Edge":[0],"and":[1,8,16,68,90,116,178],"vertex":[2,9,114],"connectivity,":[3],"as":[4,6,32],"well":[5],"edge":[7,66,69,112],"cuts":[10,124],"are":[11,25,34,159],"among":[12],"the":[13,38,97,111],"most":[14],"basic":[15,99],"fundamental":[17],"concepts":[18],"in":[19,28,50,125,146,171,184],"graph":[20],"theory.":[21],"In":[22,84],"particular,":[23],"they":[24,33],"naturally":[26],"significant":[27],"a":[29,35,47,51,57,78,126,131,172,185],"networking":[30],"context":[31],"measure":[36],"for":[37],"rate":[39],"at":[40],"which":[41],"information":[42],"can":[43,106,156,179],"be":[44,157],"transferred":[45],"across":[46],"network.":[48],"While":[49],"traditional,":[52],"sequential":[53],"setting,":[54],"there":[55,160],"is":[56,117,140],"rich":[58],"literature":[59],"(in":[60],"particular":[61],"on":[62],"problems":[63],"related":[64],"to":[65,94,120,137,143,148,165],"connectivity":[67,115,135,170],"cuts),":[70],"until":[71],"recently,":[72],"much":[73],"less":[74],"was":[75],"known":[76],"from":[77],"distributed":[79,102,151,186],"algorithms":[80],"point":[81],"of":[82,96,168],"view.":[83],"my":[85],"talk,":[86],"I":[87],"will":[88],"discuss":[89],"give":[91],"partial":[92],"answers":[93],"some":[95],"following":[98],"questions.":[100],"Using":[101],"algorithms,":[103],"how":[104],"fast":[105],"we":[107,129,180],"compute":[108],"or":[109,113],"approximate":[110],"it":[118,141],"possible":[119,142],"efficiently":[121],"find":[122],"small":[123],"network?":[127],"Assuming,":[128],"have":[130],"network":[132,161],"with":[133],"good":[134,169],"properties,":[136],"what":[138],"extent":[139],"exploit":[144],"this":[145],"order":[147],"speed":[149],"up":[150],"computations?":[152],"Where":[153],"such":[154,182],"properties":[155],"exploited,":[158],"structures":[162,183],"that":[163],"allow":[164],"make":[166],"use":[167],"structured":[173],"(and":[174],"somewhat":[175],"canonical)":[176],"way":[177],"construct":[181],"manner?":[187]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}