Decomposing clique search problems into smaller instances based on node and edge colorings (Q1744248): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.01.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2790406481 / 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: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New methods to color the vertices of a graph / 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: Test case generators and computational results for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithms for triangle free coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method / rank
 
Normal rank

Latest revision as of 13:44, 15 July 2024

scientific article
Language Label Description Also known as
English
Decomposing clique search problems into smaller instances based on node and edge colorings
scientific article

    Statements

    Decomposing clique search problems into smaller instances based on node and edge colorings (English)
    0 references
    0 references
    0 references
    20 April 2018
    0 references
    \(k\)-clique
    0 references
    maximum clique
    0 references
    clique search algorithm
    0 references
    independent set
    0 references
    branch and bound
    0 references
    node coloring
    0 references
    edge coloring
    0 references
    greedy coloring
    0 references
    combinatorial optimization
    0 references

    Identifiers