A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disopt.2008.01.001 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2008.01.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2115713772 / 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: A survey of local search methods for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The sandwich theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the chromatic number of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISOPT.2008.01.001 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:01, 10 December 2024

scientific article
Language Label Description Also known as
English
A sequential elimination algorithm for computing bounds on the clique number of a graph
scientific article

    Statements

    A sequential elimination algorithm for computing bounds on the clique number of a graph (English)
    0 references
    0 references
    0 references
    0 references
    15 August 2008
    0 references
    maximum clique
    0 references
    clique number
    0 references
    upper bounds
    0 references
    lower bounds
    0 references
    sequential elimination algorithm
    0 references

    Identifiers