scientific article

Henry A. Kierstead, William T. jun. Trotter

Publication date: 1981

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

clique number subsets covered by recursive chains recursive interval graph recursive interval order

Partial orders, general (06A06) Permutations, words, matrices (05A05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items

A subexponential upper bound for the on-line chain partitioning problem ⋮ Lower bounds for on-line graph coloring ⋮ A randomized algorithm for online unit clustering ⋮ On-line dimension of semi-orders ⋮ Coloring interval graphs with First-Fit ⋮ On-line chain partitioning of up-growing interval orders ⋮ Online promise problems with online width metrics ⋮ An improved algorithm for online coloring of intervals with bandwidth ⋮ Online Coloring and $L(2,1)$-Labeling of Unit Disk Intersection Graphs ⋮ On the on-line chromatic number of the family of on-line 3-chromatic graphs ⋮ On-line coloring of perfect graphs ⋮ Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs ⋮ An on-line graph coloring algorithm with sublinear performance ratio ⋮ Lower Bounds for On-line Graph Colorings ⋮ An On-line Competitive Algorithm for Coloring $$P_8$$-free Bipartite Graphs ⋮ On the complexity of injective colorings and its generalizations ⋮ Online selection of intervals and $t$-intervals ⋮ A new lower bound for the on-line coloring of intervals with bandwidth ⋮ Improved lower bound on the on-line chain partitioning of semi-orders with representation ⋮ Optimal on-line coloring of circular arc graphs ⋮ Improved algorithms for scheduling unsplittable flows on paths ⋮ A Modern View on Stability of Approximation ⋮ Dynamic data structures for interval coloring ⋮ On-line dimension for posets excluding two long incomparable chains ⋮ On-line chain partitions of up-growing semi-orders ⋮ Online coloring of short intervals ⋮ Lower Bounds for On-line Interval Coloring with Vector and Cardinality Constraints ⋮ Batch Coloring of Graphs ⋮ A Refined Analysis of Online Path Coloring in Trees ⋮ Unnamed Item ⋮ On-line routing in all-optical networks ⋮ First-Fit is linear on posets excluding two long incomparable chains ⋮ Non-clairvoyant scheduling with conflicts for unit-size jobs ⋮ Tight bounds for online coloring of basic graph classes ⋮ A polynomial time approximation algorithm for dynamic storage allocation ⋮ Online unit clustering: Variations on a theme ⋮ Online interval coloring with packing constraints ⋮ An easy subexponential bound for online chain partitioning ⋮ An on-line competitive algorithm for coloring bipartite graphs without long induced paths ⋮ Batch coloring of graphs ⋮ On the max coloring problem ⋮ Minimum Entropy Combinatorial Optimization Problems ⋮ First-fit coloring of bounded tolerance graphs ⋮ Minimum entropy combinatorial optimization problems ⋮ On-line graph coloring of ${\mathbb{P}_5}$-free graphs ⋮ A theory of recursive dimension of ordered sets ⋮ Graph colorings and recursively bounded $\Pi ^ 0_ 1$-classes ⋮ On the Max Coloring Problem ⋮ On the Online Unit Clustering Problem ⋮ On-line approach to off-line coloring problems on graphs with geometric representations ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ Variable sized online interval coloring with bandwidth ⋮ On-line chain partitions of orders: a survey ⋮ Fully-Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points ⋮ Unnamed Item ⋮ Tight Bounds for Online Coloring of Basic Graph Classes ⋮ On-line routing in all-optical networks ⋮ Unnamed Item ⋮ Online independent sets. ⋮ Coloring inductive graphs on-line