ON PVchunk OPERATIONS AND MATROGENIC GRAPHS

DOI10.1142/S0129054192000036MaRDI QIDQ4020277zbMATH OpenFDO

Authors Sergio De Agostino, Rossella Petreschi

Publication date 16 January 1993

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054192000036

zbMATH Keywords

exclusion graphmatrogenic graphsmutual exclusion problemparallel processesthreshold graphs

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99) Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimal Threshold Separators and Memory Requirements for Synchronization
• scientific article; zbMATH DE number 4043213
• The mutual exclusion problem
• scientific article; zbMATH DE number 4039953
• The mutual exclusion problem

Cited in

(3)

• Minimal Threshold Separators and Memory Requirements for Synchronization
• Threshold graphs and synchronization protocols
• An \(O(n^ 3)\) recognition algorithm for bithreshold graphs

This page was built for publication: ON PV_chunk OPERATIONS AND MATROGENIC GRAPHS

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