Algorithmic characterizations of interval orderd hypergraphs and applications

DOI10.1016/0166-218X(94)90105-8MaRDI QIDQ1329816zbMATH OpenFDO

Authors Sun Xiao Chao, Alain Quilliot

Publication date 31 July 1994

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

Full work available at URL https://doi.org/10.1016/0166-218X(94)90105-8

zbMATH Keywords

consecutive retrievalinterval hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• Représentation de familles ordonnées d'intervalles et applications
• Compatibility between interval structures and partial orderings
• scientific article; zbMATH DE number 1759465
• scientific article; zbMATH DE number 3908482
• Parallel interval order recognition and construction of interval representations

Cites work

• A structure theorem for the consecutive 1's property
• File organization
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3876909 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3894816 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• On unimodular matrices
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Polynomial Complete Consecutive Information Retrieval Problems
• Storage for consecutive retrieval
• The Jump Number of Dags and Posets: An Introduction

Cited in

(5)

• Preemptive scheduling and antichain polyhedra
• A type of algebraic structure related to sets of intervals
• Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
• Contiguity orders
• Exchangeable interval hypergraphs and limits of ordered discrete structures

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329816)