Inverse chromatic number problems in interval and permutation graphs
Year of publication: |
2015
|
---|---|
Authors: | Chung, Yerim ; Culus, Jean-François ; Demange, Marc |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 243.2015, 3 (16.6.), p. 763-773
|
Subject: | Inverse combinatorial optimization | Graph coloring | Interval graphs | Permutation graphs | Graphentheorie | Graph theory | Deskriptive Statistik | Descriptive statistics | Mathematik | Mathematics | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming |
-
Interval scheduling and colorful independent sets
Van Bevern, René, (2015)
-
Inductive k-independent graphs and c-colorable subgraphs in scheduling : a review
Bentert, Matthias, (2019)
-
Towards effective exact methods for the Maximum Balanced Biclique Problem in bipartite graphs
Zhou, Yi, (2018)
- More ...
-
Inverse chromatic number problems in interval and permutation graphs
Chung, Yerim, (2015)
-
The 0-1 inverse maximum stable set problem
Chung, Yerim, (2006)
-
The 0-1 inverse maximum stable set problem.
Chung, Yerim, (2006)
- More ...