Scheduling dyadic intervals

DOI10.1016/0166-218X(94)00068-OzbMath0837.90066MaRDI QIDQ1902894

Garth Isaak, James R. Driscoll, Dennis M. jun. Healy

Publication date: 3 December 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

dyadic intervalsgraph separation problemshortest schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (1)

Hamiltonian powers in threshold and arborescent comparability graphs

Cites Work

• On Some Variants of the Bandwidth Minimization Problem
• On the separation number of a graph

This page was built for publication: Scheduling dyadic intervals