The mutual exclusion scheduling problem for permutation and comparability graphs.
type: Item
instance of: scholarly article
title: The mutual exclusion scheduling problem for permutation and comparability graphs.
zbMATH Open document ID: 1054.68019
DOI: 10.1016/S0890-5401(02)00028-7
author: Klaus Jansen
published in: Information and Computation
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1967113
MaRDI profile type: Publication
cites work: A note on the decomposition of graphs into isomorphic matchings
cites work: Mutual exclusion scheduling
cites work: Partial orders of dimension 2
cites work: Q3792471
cites work: Q4326697
cites work: Q4380372
cites work: Q4260373
cites work: Q4281625
cites work: NP-completeness of graph decomposition problems
cites work: The complexity of generalized clique packing
cites work: Optimal Sequencing of Two Equivalent Processors
cites work: Q4198056
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: Bounded vertex colorings of graphs
cites work: Q4875172
cites work: The χt-coloring problem
cites work: An existential problem of a weight-controlled subset and its application to school timetable construction
cites work: Chromatic optimisation: Limitations, objectives, uses, references
cites work: A graph coloring algorithm for large scale scheduling problems
cites work: Q4694722
cites work: Q3686754
cites work: Q4918387
cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs
cites work: Q3681937
full work available at URL: s0890-5401(02)00028-7
OpenAlex ID: W2053227662
description: scientific article; zbMATH DE number 1967113