Discovering the maximum k-clique on social networks using bat optimization algorithm
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2197-4314
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
Discovering the maximum k-clique on social networks using bat optimization algorithm ; volume:8 ; number:1 ; day:2 ; month:2 ; year:2021 ; pages:1-15 ; date:12.2021
Computational Social Networks ; 8, Heft 1 (2.2.2021), 1-15, 12.2021
- Urheber
-
Khodadadi, Akram
Saeidi, Shahram
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1186/s40649-021-00087-y
- URN
-
urn:nbn:de:101:1-2021032617461406566310
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:51 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Khodadadi, Akram
- Saeidi, Shahram
- SpringerLink (Online service)
Ähnliche Objekte (12)
Discovering Maximum Entropy Knowledge
An exact algorithm to find a maximum weight clique in a weighted undirected graph
The Maximum Clique Problem for Permutation Hamming Graphs
Implementation of a maximum clique search procedure on CUDA
Solving larger maximum clique problems using parallel quantum annealing
Solving the Maximum Clique Problem via DNA Hairpin Formation
The maximum clique enumeration problem: algorithms, applications, and implementations
Cliquen
Numerical experiments with LP formulations of the maximum clique problem
Computing a maximum clique in geometric superclasses of disk graphs
An Efficient movie recommendation algorithm based on improved k-clique
A Tableau Algorithm for the Clique Guarded Fragment : Preliminary Version
Discovering Maximum Entropy Knowledge
An exact algorithm to find a maximum weight clique in a weighted undirected graph
The Maximum Clique Problem for Permutation Hamming Graphs
Implementation of a maximum clique search procedure on CUDA
Solving larger maximum clique problems using parallel quantum annealing
Solving the Maximum Clique Problem via DNA Hairpin Formation
The maximum clique enumeration problem: algorithms, applications, and implementations
Cliquen
Numerical experiments with LP formulations of the maximum clique problem
Computing a maximum clique in geometric superclasses of disk graphs
An Efficient movie recommendation algorithm based on improved k-clique
A Tableau Algorithm for the Clique Guarded Fragment : Preliminary Version
Discovering Maximum Entropy Knowledge
An exact algorithm to find a maximum weight clique in a weighted undirected graph
The Maximum Clique Problem for Permutation Hamming Graphs
Implementation of a maximum clique search procedure on CUDA
Solving larger maximum clique problems using parallel quantum annealing
Solving the Maximum Clique Problem via DNA Hairpin Formation
The maximum clique enumeration problem: algorithms, applications, and implementations
Cliquen
Numerical experiments with LP formulations of the maximum clique problem
Computing a maximum clique in geometric superclasses of disk graphs
An Efficient movie recommendation algorithm based on improved k-clique