Enumerating cliques and their relaxations
Du sparer
0%
ift. normalprisen
Spar
0%
- Indbinding:
- Paperback
- Sideantal:
- 128
- Udgivet:
- 31. maj 2019
- Størrelse:
- 150x8x220 mm.
- Vægt:
- 209 g.
- 2-3 uger.
- 25. november 2024
På lager
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Enumerating cliques and their relaxations
Clique counting is an important problem in a variety of network analytics applications. We provide an extensive literature review of subgraph enumeration, considering different problems associated to cliques, clique relaxations, and other kind of subgraphs. We then devise algorithms for the problems of enumerating k-cliques (i.e., complete subgraphs on k nodes) and one of their relaxations, called k-diamonds (i.e., cliques of size k with one missing edge). For the first problem we present simple and fast multicore parallel algorithms for counting the number of k-cliques in large undirected graphs, for any small constant k ¿ 4. Differently from existing solutions, which mainly target distributed memory settings (e.g., MapReduce), the proposed algorithms work on off-the-shelf shared-memory multicore platforms. For the second problem, we first devise a sequential algorithm for counting the number of k-diamonds in large undirected graphs, for any small constant k ¿ 4. A parallel extension of the sequential algorithm is then proposed, developing a MapReduce-based approach.
Brugerbedømmelser af Enumerating cliques and their relaxations
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
© 2024 Pling BØGER Registered company number: DK43351621