Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10732-012-9207-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036313802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Clique in an Arbitrary Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region technique for the maximum weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple ingredients leading to very efficient heuristics for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Detecting and Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the maximum clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Test case generators and computational results for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phased local search for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3623999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of ACO capabilities for solving the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge‐maximal triangulated subgraphs and heuristics for the maximum clique problem / rank
 
Normal rank

Revision as of 00:32, 14 July 2024

scientific article
Language Label Description Also known as
English
Subgraph extraction and metaheuristics for the maximum clique problem
scientific article

    Statements

    Subgraph extraction and metaheuristics for the maximum clique problem (English)
    0 references
    0 references
    0 references
    27 June 2017
    0 references
    maximum clique problem
    0 references
    triangulated graph
    0 references
    circular-arc graph
    0 references
    genetic algorithm
    0 references
    iterated local search
    0 references
    metaheuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references