Matches in SemOpenAlex for { <https://semopenalex.org/work/W2891473438> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W2891473438 abstract "A central problem in graph mining is finding dense subgraphs, with several applications in different fields, a notable example being identifying communities. While a lot of effort has been put on the problem of finding a single dense subgraph, only recently the focus has been shifted to the problem of finding a set of densest subgraphs. Some approaches aim at finding disjoint subgraphs, while in many real-world networks communities are often overlapping. An approach introduced to find possible overlapping subgraphs is the Top-k Overlapping Densest Subgraphs problem. For a given integer k >= 1, the goal of this problem is to find a set of k densest subgraphs that may share some vertices. The objective function to be maximized takes into account both the density of the subgraphs and the distance between subgraphs in the solution. The Top-k Overlapping Densest Subgraphs problem has been shown to admit a 1/10-factor approximation algorithm. Furthermore, the computational complexity of the problem has been left open. In this paper, we present contributions concerning the approximability and the computational complexity of the problem. For the approximability, we present approximation algorithms that improves the approximation factor to 1/2 , when k is bounded by the vertex set, and to 2/3 when k is a constant. For the computational complexity, we show that the problem is NP-hard even when k = 3." @default.
- W2891473438 created "2018-09-27" @default.
- W2891473438 creator A5034996367 @default.
- W2891473438 creator A5047943010 @default.
- W2891473438 creator A5059320347 @default.
- W2891473438 creator A5073338435 @default.
- W2891473438 date "2018-09-07" @default.
- W2891473438 modified "2023-09-23" @default.
- W2891473438 title "Top-k Overlapping Densest Subgraphs: Approximation and Complexity" @default.
- W2891473438 cites W1975442866 @default.
- W2891473438 cites W2089494972 @default.
- W2891473438 cites W2100978151 @default.
- W2891473438 cites W2610183793 @default.
- W2891473438 hasPublicationYear "2018" @default.
- W2891473438 type Work @default.
- W2891473438 sameAs 2891473438 @default.
- W2891473438 citedByCount "0" @default.
- W2891473438 crossrefType "posted-content" @default.
- W2891473438 hasAuthorship W2891473438A5034996367 @default.
- W2891473438 hasAuthorship W2891473438A5047943010 @default.
- W2891473438 hasAuthorship W2891473438A5059320347 @default.
- W2891473438 hasAuthorship W2891473438A5073338435 @default.
- W2891473438 hasConcept C11413529 @default.
- W2891473438 hasConcept C114614502 @default.
- W2891473438 hasConcept C118615104 @default.
- W2891473438 hasConcept C132525143 @default.
- W2891473438 hasConcept C134306372 @default.
- W2891473438 hasConcept C148764684 @default.
- W2891473438 hasConcept C177264268 @default.
- W2891473438 hasConcept C179799912 @default.
- W2891473438 hasConcept C19754495 @default.
- W2891473438 hasConcept C199360897 @default.
- W2891473438 hasConcept C33923547 @default.
- W2891473438 hasConcept C34388435 @default.
- W2891473438 hasConcept C41008148 @default.
- W2891473438 hasConcept C45340560 @default.
- W2891473438 hasConcept C80899671 @default.
- W2891473438 hasConceptScore W2891473438C11413529 @default.
- W2891473438 hasConceptScore W2891473438C114614502 @default.
- W2891473438 hasConceptScore W2891473438C118615104 @default.
- W2891473438 hasConceptScore W2891473438C132525143 @default.
- W2891473438 hasConceptScore W2891473438C134306372 @default.
- W2891473438 hasConceptScore W2891473438C148764684 @default.
- W2891473438 hasConceptScore W2891473438C177264268 @default.
- W2891473438 hasConceptScore W2891473438C179799912 @default.
- W2891473438 hasConceptScore W2891473438C19754495 @default.
- W2891473438 hasConceptScore W2891473438C199360897 @default.
- W2891473438 hasConceptScore W2891473438C33923547 @default.
- W2891473438 hasConceptScore W2891473438C34388435 @default.
- W2891473438 hasConceptScore W2891473438C41008148 @default.
- W2891473438 hasConceptScore W2891473438C45340560 @default.
- W2891473438 hasConceptScore W2891473438C80899671 @default.
- W2891473438 hasLocation W28914734381 @default.
- W2891473438 hasOpenAccess W2891473438 @default.
- W2891473438 hasPrimaryLocation W28914734381 @default.
- W2891473438 hasRelatedWork W1537328843 @default.
- W2891473438 hasRelatedWork W1618375835 @default.
- W2891473438 hasRelatedWork W1772739528 @default.
- W2891473438 hasRelatedWork W1901626616 @default.
- W2891473438 hasRelatedWork W2021558800 @default.
- W2891473438 hasRelatedWork W2083522899 @default.
- W2891473438 hasRelatedWork W2083586074 @default.
- W2891473438 hasRelatedWork W2107080175 @default.
- W2891473438 hasRelatedWork W2139077607 @default.
- W2891473438 hasRelatedWork W2143076088 @default.
- W2891473438 hasRelatedWork W2296143143 @default.
- W2891473438 hasRelatedWork W270827711 @default.
- W2891473438 hasRelatedWork W2755686305 @default.
- W2891473438 hasRelatedWork W2775206256 @default.
- W2891473438 hasRelatedWork W2789140502 @default.
- W2891473438 hasRelatedWork W28249417 @default.
- W2891473438 hasRelatedWork W2963588936 @default.
- W2891473438 hasRelatedWork W3193031119 @default.
- W2891473438 hasRelatedWork W1603912888 @default.
- W2891473438 hasRelatedWork W1849583273 @default.
- W2891473438 isParatext "false" @default.
- W2891473438 isRetracted "false" @default.
- W2891473438 magId "2891473438" @default.
- W2891473438 workType "article" @default.