Inverse chromatic number problems in interval and permutation graphs (Q319198): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.ejor.2014.12.028 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999254574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling equal-length jobs on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blockers for the stability number and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(k\)-track assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an instance of the inverse shortest paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 inverse maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On inverse traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tutorial on the use of graph coloring for some problems in robotics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some applications of the selective graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the selective graph coloring problem in some special classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of coloring models for scheduling purposes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency planning and ramifications of coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chain and antichain families of a partially ordered set / 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: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The edge intersection graphs of paths in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On coloring unit disk graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some partitions associated with a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of Sperner k-families / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tabu search metaheuristic: How we used it / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 2-Dimensional Channel Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Isotone Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-approximability of just-in-time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-Machine Scheduling of Unit-Time Jobs with Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse maximum flow and minimum cut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum k-colorable subgraph problem for chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The robust coloring problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inverse problem of minimum cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity analysis of the inverse center location problem / rank
 
Normal rank

Latest revision as of 15:37, 12 July 2024

scientific article
Language Label Description Also known as
English
Inverse chromatic number problems in interval and permutation graphs
scientific article

    Statements

    Inverse chromatic number problems in interval and permutation graphs (English)
    0 references
    0 references
    0 references
    0 references
    6 October 2016
    0 references
    inverse combinatorial optimization
    0 references
    graph coloring
    0 references
    interval graphs
    0 references
    permutation graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers