scientific article; zbMATH DE number 219236
From MaRDI portal
Publication:4694722
zbMath0768.68052MaRDI QIDQ4694722
Publication date: 29 June 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
partitioncomputational complexitysplit graphchainsantichainsinterval ordersNP- completeseries-parallel orders
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (15)
Scheduling with conflicts: Online and offline algorithms ⋮ Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms ⋮ Mutual exclusion scheduling ⋮ On the thinness and proper thinness of a graph ⋮ The mutual exclusion scheduling problem for permutation and comparability graphs. ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ Mutual exclusion scheduling with interval graphs or related classes. II ⋮ Scheduling jobs on identical machines with agreement graph ⋮ Chain partitions of ordered sets ⋮ Mutual exclusion scheduling with interval graphs or related classes. I ⋮ An approximation scheme for bin packing with conflicts ⋮ Treelike comparability graphs ⋮ Clique and anticlique partitions of graphs ⋮ Clique partitioning with value-monotone submodular cost ⋮ Equitable colorings of bounded treewidth graphs
This page was built for publication:
