scientific article
From MaRDI portal
Publication:3681937
zbMath0566.68041MaRDI QIDQ3681937
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of packing and covering (05B40)
Related Items (16)
Partitioning permutations into monotone subsequences ⋮ Partitioning permutations into increasing and decreasing subsequences ⋮ The mixed page number of graphs ⋮ Complete edge-colored permutation graphs ⋮ Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization ⋮ The mutual exclusion scheduling problem for permutation and comparability graphs. ⋮ Fixed-parameter algorithms for the cocoloring problem ⋮ Partitioning extended \(P_4\)-laden graphs into cliques and stable sets ⋮ An unfeasible matching problem ⋮ A tutorial on the use of graph coloring for some problems in robotics ⋮ Sorting shuffled monotone sequences ⋮ On minimum \(k\)-modal partitions of permutations ⋮ A linear time approximation algorithm for permutation flow shop scheduling ⋮ Partitioning cographs into cliques and stable sets ⋮ Approximating minimum cocolorings. ⋮ On cocolourings and cochromatic numbers of graphs
This page was built for publication:
