- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1573-2878
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
The Maximum Clique Problem for Permutation Hamming Graphs ; volume:194 ; number:2 ; day:13 ; month:5 ; year:2022 ; pages:492-507 ; date:8.2022
Journal of optimization theory and applications ; 194, Heft 2 (13.5.2022), 492-507, 8.2022
- Creator
-
Barta, János
Montemanni, Roberto
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/s10957-022-02035-w
- URN
-
urn:nbn:de:101:1-2022082923362542114957
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:22 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
- Barta, János
- Montemanni, Roberto
- SpringerLink (Online service)
Other Objects (12)
Computing a maximum clique in geometric superclasses of disk graphs
Reduced Clique Graphs: A Correction to “Chordal Graphs and Their Clique Graphs”
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
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
Succinct Permutation Graphs
Numerical experiments with LP formulations of the maximum clique problem
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Helly property, clique raphs, complementary graph classes, and sandwich problems
An exact algorithm to find a maximum weight clique in a weighted undirected graph
GraphZIP: a clique-based sparse graph compression method
Computing a maximum clique in geometric superclasses of disk graphs
Reduced Clique Graphs: A Correction to “Chordal Graphs and Their Clique Graphs”
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
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
Succinct Permutation Graphs
Numerical experiments with LP formulations of the maximum clique problem
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Helly property, clique raphs, complementary graph classes, and sandwich problems
An exact algorithm to find a maximum weight clique in a weighted undirected graph
GraphZIP: a clique-based sparse graph compression method
Computing a maximum clique in geometric superclasses of disk graphs
Reduced Clique Graphs: A Correction to “Chordal Graphs and Their Clique Graphs”
Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
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
Succinct Permutation Graphs
Numerical experiments with LP formulations of the maximum clique problem
RCPred: RNA complex prediction as a constrained maximum weight clique problem
Helly property, clique raphs, complementary graph classes, and sandwich problems
An exact algorithm to find a maximum weight clique in a weighted undirected graph