scientific article; zbMATH DE number 4043213

MaRDI QIDQ3780408zbMATH OpenFDO

Authors Edward T. Ordman

Publication date 1985

zbMATH Keywords

clique numberdining philosophers problemdistributed computer systemhypergraphsynchronization algorithmsthreshold dimension

Mathematics Subject Classification ID

Theory of software (68N99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 4039953
• Minimal Threshold Separators and Memory Requirements for Synchronization
• Sharing resources at nonuniform access rates
• On the generalized dining philosophers problem
• On quorum systems for group resources allocation

Cited in

(14)

• Total matchings and total coverings of threshold graphs
• A priority dynamics for generalized drinking philosophers
• On dynamic threshold graphs and related classes
• Extension of threshold graphs under complex fuzzy environment
• Complex Pythagorean fuzzy threshold graphs with application in petroleum replenishment
• scientific article; zbMATH DE number 4039953 (Why is no real title available?)
• Minimal Threshold Separators and Memory Requirements for Synchronization
• ON PV_chunk OPERATIONS AND MATROGENIC GRAPHS
• Resource-sharing systems and hypergraph colorings
• Threshold graphs under Pythagorean fuzzy information
• Sharing resources at nonuniform access rates
• Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs
• Threshold graphs and synchronization protocols
• Bipartite bithreshold graphs

This page was built for publication:

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