Constructive generation of very hard 3-colorability instances (Q2467358): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.dam.2006.07.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000872069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / 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: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frozen development in graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of 4-Coloring a 3-Colorable Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3754634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local optima topology for the \(k\)-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardest constraint problems: A double phase transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consistency in networks of relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386968 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting the deep structure of constraint problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:36, 27 June 2024

scientific article
Language Label Description Also known as
English
Constructive generation of very hard 3-colorability instances
scientific article

    Statements

    Constructive generation of very hard 3-colorability instances (English)
    0 references
    0 references
    0 references
    21 January 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    search
    0 references
    phase transition
    0 references
    NP-complete
    0 references
    hard problem
    0 references
    heuristics
    0 references
    constraint satisfaction
    0 references
    0 references