- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
0219-3116
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A meta-algorithm for finding large k-plexes ; volume:63 ; number:7 ; day:1 ; month:5 ; year:2021 ; pages:1745-1769 ; date:7.2021
Knowledge and information systems ; 63, Heft 7 (1.5.2021), 1745-1769, 7.2021
- Urheber
-
Conte, Alessio
Firmani, Donatella
Patrignani, Maurizio
Torlone, Riccardo
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s10115-021-01570-8
- URN
-
urn:nbn:de:101:1-2021100719243641674300
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:38 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
- Conte, Alessio
- Firmani, Donatella
- Patrignani, Maurizio
- Torlone, Riccardo
- SpringerLink (Online service)
Ähnliche Objekte (12)
A fast algorithm for finding the confidence set of large collections of models
Multiple organism algorithm for finding ultraconserved elements
A deterministic algorithm for finding r-power divisors
Kavosh : a new algorithm for finding network motifs
XGANDALF – extended gradient descent algorithm for lattice finding
Kavosh: a new algorithm for finding network motifs
A One Pass Streaming Algorithm for Finding Euler Tours
A One Pass Streaming Algorithm for Finding Euler Tours
Finding reproducible cluster partitions for the k-means algorithm
Efficient motif finding algorithms for large-alphabet inputs
Finding eigenvectors with a quantum variational algorithm
IFSA-EUSFLAT - Fuzzy-enhanced path-finding algorithm for AGV roadmaps
A fast algorithm for finding the confidence set of large collections of models
Multiple organism algorithm for finding ultraconserved elements
A deterministic algorithm for finding r-power divisors
Kavosh : a new algorithm for finding network motifs
XGANDALF – extended gradient descent algorithm for lattice finding
Kavosh: a new algorithm for finding network motifs
A One Pass Streaming Algorithm for Finding Euler Tours
A One Pass Streaming Algorithm for Finding Euler Tours
Finding reproducible cluster partitions for the k-means algorithm
Efficient motif finding algorithms for large-alphabet inputs
Finding eigenvectors with a quantum variational algorithm
IFSA-EUSFLAT - Fuzzy-enhanced path-finding algorithm for AGV roadmaps
A fast algorithm for finding the confidence set of large collections of models
Multiple organism algorithm for finding ultraconserved elements
A deterministic algorithm for finding r-power divisors
Kavosh : a new algorithm for finding network motifs
XGANDALF – extended gradient descent algorithm for lattice finding
Kavosh: a new algorithm for finding network motifs
A One Pass Streaming Algorithm for Finding Euler Tours
A One Pass Streaming Algorithm for Finding Euler Tours
Finding reproducible cluster partitions for the k-means algorithm
Efficient motif finding algorithms for large-alphabet inputs
Finding eigenvectors with a quantum variational algorithm