About equivalent interval colorings of weighted graphs (Q967426): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / 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.dam.2009.04.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151966264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>OPT</i>Versus<i>LOAD</i>in Dynamic Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Colouring Algorithms for Composite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consecutive colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / 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: Q4252403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Interval vertex-coloring of a graph with forbidden colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating interval coloring and max-coloring in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for finding in the lump both bounds of the chromatic number of a graph / rank
 
Normal rank

Latest revision as of 19:28, 2 July 2024

scientific article
Language Label Description Also known as
English
About equivalent interval colorings of weighted graphs
scientific article

    Statements

    About equivalent interval colorings of weighted graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 April 2010
    0 references
    0 references
    interval coloring problem (ICP)
    0 references
    weighted graphs
    0 references
    equivalent colorings
    0 references
    0 references