Matches in SemOpenAlex for { <https://semopenalex.org/work/W3201676297> ?p ?o ?g. }
Showing items 1 to 69 of
69
with 100 items per page.
- W3201676297 startingPage "108" @default.
- W3201676297 abstract "In this work, we resolve the query complexity of global minimum cut problem for a graph by designing a randomized algorithm for approximating the size of minimum cut in a graph, where the graph can be accessed through local queries like {sc Degree}, {sc Neighbor}, and {sc Adjacency} queries. Given $epsilon in (0,1)$, the algorithm with high probability outputs an estimate $hat{t}$ satisfying the following $(1-epsilon) t leq hat{t} leq (1+epsilon) t$, where $m$ is the number of edges in the graph and $t$ is the size of minimum cut in the graph. The expected number of local queries used by our algorithm is $minleft{m+n,frac{m}{t}right}mbox{poly}left(log n,frac{1}{epsilon}right)$ where $n$ is the number of vertices in the graph. Eden and Rosenbaum showed that $Omega(m/t)$ many local queries are required for approximating the size of minimum cut in graphs. These two results together resolve the query complexity of the problem of estimating the size of minimum cut in graphs using local queries. Building on the lower bound of Eden and Rosenbaum, we show that, for all $t in mathbb{N}$, $Omega(m)$ local queries are required to decide if the size of the minimum cut in the graph is $t$ or $t-2$. Also, we show that, for any $t in mathbb{N}$, $Omega(m)$ local queries are required to find all the minimum cut edges even if it is promised that the input graph has a minimum cut of size $t$. Both of our lower bound results are randomized, and hold even if we can make {sc Random Edge} query apart from local queries." @default.
- W3201676297 created "2021-10-11" @default.
- W3201676297 creator A5020352999 @default.
- W3201676297 creator A5051373260 @default.
- W3201676297 creator A5067692485 @default.
- W3201676297 creator A5068264438 @default.
- W3201676297 date "2020-01-01" @default.
- W3201676297 modified "2023-09-23" @default.
- W3201676297 title "Query Complexity of Global Minimum Cut." @default.
- W3201676297 hasPublicationYear "2020" @default.
- W3201676297 type Work @default.
- W3201676297 sameAs 3201676297 @default.
- W3201676297 citedByCount "0" @default.
- W3201676297 crossrefType "journal-article" @default.
- W3201676297 hasAuthorship W3201676297A5020352999 @default.
- W3201676297 hasAuthorship W3201676297A5051373260 @default.
- W3201676297 hasAuthorship W3201676297A5067692485 @default.
- W3201676297 hasAuthorship W3201676297A5068264438 @default.
- W3201676297 hasConcept C114614502 @default.
- W3201676297 hasConcept C118615104 @default.
- W3201676297 hasConcept C121332964 @default.
- W3201676297 hasConcept C132525143 @default.
- W3201676297 hasConcept C134306372 @default.
- W3201676297 hasConcept C185690422 @default.
- W3201676297 hasConcept C2779557605 @default.
- W3201676297 hasConcept C33923547 @default.
- W3201676297 hasConcept C62520636 @default.
- W3201676297 hasConcept C63553672 @default.
- W3201676297 hasConcept C77553402 @default.
- W3201676297 hasConceptScore W3201676297C114614502 @default.
- W3201676297 hasConceptScore W3201676297C118615104 @default.
- W3201676297 hasConceptScore W3201676297C121332964 @default.
- W3201676297 hasConceptScore W3201676297C132525143 @default.
- W3201676297 hasConceptScore W3201676297C134306372 @default.
- W3201676297 hasConceptScore W3201676297C185690422 @default.
- W3201676297 hasConceptScore W3201676297C2779557605 @default.
- W3201676297 hasConceptScore W3201676297C33923547 @default.
- W3201676297 hasConceptScore W3201676297C62520636 @default.
- W3201676297 hasConceptScore W3201676297C63553672 @default.
- W3201676297 hasConceptScore W3201676297C77553402 @default.
- W3201676297 hasLocation W32016762971 @default.
- W3201676297 hasOpenAccess W3201676297 @default.
- W3201676297 hasPrimaryLocation W32016762971 @default.
- W3201676297 hasRelatedWork W1993294649 @default.
- W3201676297 hasRelatedWork W2150567347 @default.
- W3201676297 hasRelatedWork W2245158765 @default.
- W3201676297 hasRelatedWork W2296024774 @default.
- W3201676297 hasRelatedWork W2586277680 @default.
- W3201676297 hasRelatedWork W2735927512 @default.
- W3201676297 hasRelatedWork W2918050317 @default.
- W3201676297 hasRelatedWork W2950666218 @default.
- W3201676297 hasRelatedWork W2953253371 @default.
- W3201676297 hasRelatedWork W2982297668 @default.
- W3201676297 hasRelatedWork W3022682740 @default.
- W3201676297 hasRelatedWork W3046333515 @default.
- W3201676297 hasRelatedWork W3073529507 @default.
- W3201676297 hasRelatedWork W3103185047 @default.
- W3201676297 hasRelatedWork W3106308476 @default.
- W3201676297 hasRelatedWork W3130010324 @default.
- W3201676297 hasRelatedWork W3130215558 @default.
- W3201676297 hasRelatedWork W3159580594 @default.
- W3201676297 hasRelatedWork W3208037711 @default.
- W3201676297 hasRelatedWork W3210180238 @default.
- W3201676297 hasVolume "27" @default.
- W3201676297 isParatext "false" @default.
- W3201676297 isRetracted "false" @default.
- W3201676297 magId "3201676297" @default.
- W3201676297 workType "article" @default.