- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1613-9178
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Numerical experiments with LP formulations of the maximum clique problem ; day:5 ; month:9 ; year:2021 ; pages:1-15
Central European journal of operations research ; (5.9.2021), 1-15
- Creator
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10100-021-00776-z
- URN
-
urn:nbn:de:101:1-2021111722051172811422
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:38 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kardos, Dóra
- Patassy, Patrik
- Szabó, Sándor
- Zaválnij, Bogdán
- SpringerLink (Online service)
Other Objects (12)
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
Computing a maximum clique in geometric superclasses of disk graphs
Cliquen
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
Die Clique
Maliks Clique
Die Clique
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
Computing a maximum clique in geometric superclasses of disk graphs
Cliquen
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
Die Clique
Maliks Clique
Die Clique
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
Computing a maximum clique in geometric superclasses of disk graphs
Cliquen
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
Die Clique
Maliks Clique