Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Scheduling dyadic intervals

From MaRDI portal
Publication:1902894
Jump to:navigation, search

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1902894&oldid=14316163"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki