Matches in SemOpenAlex for { <https://semopenalex.org/work/W2402507904> ?p ?o ?g. }
Showing items 1 to 82 of
82
with 100 items per page.
- W2402507904 endingPage "573" @default.
- W2402507904 startingPage "566" @default.
- W2402507904 abstract "AbstractThe density of a subgraph in an undirected graph is the sum of the subgraph’s edge weights divided by the number of the subgraph’s vertices. Finding an induced subgraph of maximum density among all subgraphs with at least k vertices is called as the densest at-least-k-subgraph problem (DalkS).In this paper, we first present a polynomial time algorithms for DalkS when k is bounded by some constant c. For a graph of n vertices and m edges, our algorithm is of time complexity (O(n^{c + 3} log n)), which improve previous best time complexity (O(n^c(n+m)^{4.5})).Second, we give a greedy approximation algorithm for the Densest Subgraph with a Specified Subset Problem. We show that the greedy algorithm is of approximation ratio (2cdot (1+ frac{k}{3})), where k is the element number of the specified subset.KeywordsDense SubgraphsGreedy Approximation AlgorithmSubset ProblemsGene Annotation GraphsBinary Search FashionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves." @default.
- W2402507904 created "2016-06-24" @default.
- W2402507904 creator A5015464256 @default.
- W2402507904 creator A5035273000 @default.
- W2402507904 creator A5045712324 @default.
- W2402507904 creator A5052370366 @default.
- W2402507904 creator A5067384850 @default.
- W2402507904 date "2015-01-01" @default.
- W2402507904 modified "2023-09-27" @default.
- W2402507904 title "Algorithms for the Densest Subgraph with at Least k Vertices and with a Specified Subset" @default.
- W2402507904 cites W1500512125 @default.
- W2402507904 cites W1502940150 @default.
- W2402507904 cites W1535144194 @default.
- W2402507904 cites W1596683029 @default.
- W2402507904 cites W1888358353 @default.
- W2402507904 cites W2013469283 @default.
- W2402507904 cites W2027029507 @default.
- W2402507904 cites W2036836182 @default.
- W2402507904 cites W2160556205 @default.
- W2402507904 doi "https://doi.org/10.1007/978-3-319-26626-8_41" @default.
- W2402507904 hasPublicationYear "2015" @default.
- W2402507904 type Work @default.
- W2402507904 sameAs 2402507904 @default.
- W2402507904 citedByCount "1" @default.
- W2402507904 countsByYear W24025079042019 @default.
- W2402507904 crossrefType "book-chapter" @default.
- W2402507904 hasAuthorship W2402507904A5015464256 @default.
- W2402507904 hasAuthorship W2402507904A5035273000 @default.
- W2402507904 hasAuthorship W2402507904A5045712324 @default.
- W2402507904 hasAuthorship W2402507904A5052370366 @default.
- W2402507904 hasAuthorship W2402507904A5067384850 @default.
- W2402507904 hasConcept C114614502 @default.
- W2402507904 hasConcept C118615104 @default.
- W2402507904 hasConcept C131992880 @default.
- W2402507904 hasConcept C132525143 @default.
- W2402507904 hasConcept C134306372 @default.
- W2402507904 hasConcept C148764684 @default.
- W2402507904 hasConcept C191241153 @default.
- W2402507904 hasConcept C203776342 @default.
- W2402507904 hasConcept C22149727 @default.
- W2402507904 hasConcept C2778012994 @default.
- W2402507904 hasConcept C3018234147 @default.
- W2402507904 hasConcept C311688 @default.
- W2402507904 hasConcept C33923547 @default.
- W2402507904 hasConcept C34388435 @default.
- W2402507904 hasConcept C63553672 @default.
- W2402507904 hasConcept C80899671 @default.
- W2402507904 hasConceptScore W2402507904C114614502 @default.
- W2402507904 hasConceptScore W2402507904C118615104 @default.
- W2402507904 hasConceptScore W2402507904C131992880 @default.
- W2402507904 hasConceptScore W2402507904C132525143 @default.
- W2402507904 hasConceptScore W2402507904C134306372 @default.
- W2402507904 hasConceptScore W2402507904C148764684 @default.
- W2402507904 hasConceptScore W2402507904C191241153 @default.
- W2402507904 hasConceptScore W2402507904C203776342 @default.
- W2402507904 hasConceptScore W2402507904C22149727 @default.
- W2402507904 hasConceptScore W2402507904C2778012994 @default.
- W2402507904 hasConceptScore W2402507904C3018234147 @default.
- W2402507904 hasConceptScore W2402507904C311688 @default.
- W2402507904 hasConceptScore W2402507904C33923547 @default.
- W2402507904 hasConceptScore W2402507904C34388435 @default.
- W2402507904 hasConceptScore W2402507904C63553672 @default.
- W2402507904 hasConceptScore W2402507904C80899671 @default.
- W2402507904 hasLocation W24025079041 @default.
- W2402507904 hasOpenAccess W2402507904 @default.
- W2402507904 hasPrimaryLocation W24025079041 @default.
- W2402507904 hasRelatedWork W1500512125 @default.
- W2402507904 hasRelatedWork W1544045550 @default.
- W2402507904 hasRelatedWork W1971827573 @default.
- W2402507904 hasRelatedWork W2016775514 @default.
- W2402507904 hasRelatedWork W2032950096 @default.
- W2402507904 hasRelatedWork W2073919081 @default.
- W2402507904 hasRelatedWork W2132991500 @default.
- W2402507904 hasRelatedWork W2168309835 @default.
- W2402507904 hasRelatedWork W2402507904 @default.
- W2402507904 hasRelatedWork W31735291 @default.
- W2402507904 isParatext "false" @default.
- W2402507904 isRetracted "false" @default.
- W2402507904 magId "2402507904" @default.
- W2402507904 workType "book-chapter" @default.