Algorithmic characterizations of interval orderd hypergraphs and applications

DOI10.1016/0166-218X(94)90105-8zbMath0810.68105MaRDI QIDQ1329816

Sun Xiao Chao, Alain Quilliot

Publication date: 31 July 1994

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

zbMATH Keywords

consecutive retrievalinterval hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Structural characterization of families of graphs (05C75)

Related Items (3)

Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results ⋮ Preemptive scheduling and antichain polyhedra ⋮ A type of algebraic structure related to sets of intervals

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Storage for consecutive retrieval
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• A structure theorem for the consecutive 1's property
• On unimodular matrices
• The Jump Number of Dags and Posets: An Introduction
• Polynomial Complete Consecutive Information Retrieval Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• File organization

This page was built for publication: Algorithmic characterizations of interval orderd hypergraphs and applications