Infra-chromatic bound for exact maximum clique search (Q342100): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6654058 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate coloring
Property / zbMATH Keywords: approximate coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-bound
Property / zbMATH Keywords: branch-and-bound / rank
 
Normal rank
Property / zbMATH Keywords
 
MaxSAT
Property / zbMATH Keywords: MaxSAT / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial optimization
Property / zbMATH Keywords: combinatorial optimization / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MaxCliqueDyn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: biicode / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 457 / rank
 
Normal rank
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.1016/j.cor.2015.06.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W749637598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 457: finding all cliques of an undirected 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: Q4411385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / 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: An exact bit-parallel algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bit parallel exact maximum clique algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding a maximum clique in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements to MCS algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for maximum clique: a computational study / 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: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review on algorithms for maximum clique problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:56, 12 July 2024

scientific article
Language Label Description Also known as
English
Infra-chromatic bound for exact maximum clique search
scientific article

    Statements

    Infra-chromatic bound for exact maximum clique search (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    approximate coloring
    0 references
    branch-and-bound
    0 references
    MaxSAT
    0 references
    combinatorial optimization
    0 references
    0 references
    0 references
    0 references

    Identifiers