Matches in SemOpenAlex for { <https://semopenalex.org/work/W2018081021> ?p ?o ?g. }
Showing items 1 to 56 of
56
with 100 items per page.
- W2018081021 endingPage "649" @default.
- W2018081021 startingPage "643" @default.
- W2018081021 abstract "We consider the problem of finding in an undirected graph a minimum cut that separates exactly a given number k of vertices. For general k (i.e. k is part of the input and may depend on n ) this problem is NP-hard. We present for this problem a randomized approximation algorithm, which is useful when k is relatively small. In particular, for k= O ( log n) we obtain a polynomial time approximation scheme, and for k=Ω( log n) we obtain an approximation ratio O (k/ log n) ." @default.
- W2018081021 created "2016-06-24" @default.
- W2018081021 creator A5013190102 @default.
- W2018081021 creator A5037378898 @default.
- W2018081021 creator A5066000219 @default.
- W2018081021 date "2003-05-01" @default.
- W2018081021 modified "2023-09-28" @default.
- W2018081021 title "On cutting a few vertices from a graph" @default.
- W2018081021 cites W2005887911 @default.
- W2018081021 cites W2011601876 @default.
- W2018081021 cites W2030087828 @default.
- W2018081021 cites W2157948169 @default.
- W2018081021 cites W2168919539 @default.
- W2018081021 doi "https://doi.org/10.1016/s0166-218x(02)00394-3" @default.
- W2018081021 hasPublicationYear "2003" @default.
- W2018081021 type Work @default.
- W2018081021 sameAs 2018081021 @default.
- W2018081021 citedByCount "24" @default.
- W2018081021 countsByYear W20180810212013 @default.
- W2018081021 countsByYear W20180810212014 @default.
- W2018081021 countsByYear W20180810212016 @default.
- W2018081021 countsByYear W20180810212022 @default.
- W2018081021 countsByYear W20180810212023 @default.
- W2018081021 crossrefType "journal-article" @default.
- W2018081021 hasAuthorship W2018081021A5013190102 @default.
- W2018081021 hasAuthorship W2018081021A5037378898 @default.
- W2018081021 hasAuthorship W2018081021A5066000219 @default.
- W2018081021 hasBestOaLocation W20180810211 @default.
- W2018081021 hasConcept C114614502 @default.
- W2018081021 hasConcept C132525143 @default.
- W2018081021 hasConcept C33923547 @default.
- W2018081021 hasConceptScore W2018081021C114614502 @default.
- W2018081021 hasConceptScore W2018081021C132525143 @default.
- W2018081021 hasConceptScore W2018081021C33923547 @default.
- W2018081021 hasIssue "3" @default.
- W2018081021 hasLocation W20180810211 @default.
- W2018081021 hasLocation W20180810212 @default.
- W2018081021 hasOpenAccess W2018081021 @default.
- W2018081021 hasPrimaryLocation W20180810211 @default.
- W2018081021 hasRelatedWork W1527576459 @default.
- W2018081021 hasRelatedWork W1596060973 @default.
- W2018081021 hasRelatedWork W1978042415 @default.
- W2018081021 hasRelatedWork W2017331178 @default.
- W2018081021 hasRelatedWork W2559087450 @default.
- W2018081021 hasRelatedWork W2582950667 @default.
- W2018081021 hasRelatedWork W2950494693 @default.
- W2018081021 hasRelatedWork W2976797620 @default.
- W2018081021 hasRelatedWork W3086542228 @default.
- W2018081021 hasRelatedWork W4214740985 @default.
- W2018081021 hasVolume "127" @default.
- W2018081021 isParatext "false" @default.
- W2018081021 isRetracted "false" @default.
- W2018081021 magId "2018081021" @default.
- W2018081021 workType "article" @default.