The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs

Jansen, Klaus

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs

MPS-Authors

/persons/resource/persons44695

Jansen, Klaus
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Jansen, K. (1998). The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs. In M. Morvan, C. Meinel, & D. Krob (Eds.), Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98) (pp. 287-297). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-37F3-D

Abstract

There is no abstract available