Threshold hypergraphs

DOI10.1016/0012-365X(85)90080-9zbMath0564.05043OpenAlexW4213070679MaRDI QIDQ1057879

Edita Šiňajová, Vojtěch Rödl, Jan Reiterman, Miroslav Tůma

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90080-9

zbMATH Keywords

integer programmingparallel processingThreshold graphsthreshold hypergraphs

Mathematics Subject Classification ID

Integer programming (90C10) Hypergraphs (05C65)

Related Items (16)

Some complexity results about threshold graphs ⋮ Minkowski complexes and convex threshold dimension ⋮ Dualization of regular Boolean functions ⋮ Some approaches for solving the general (\(t,k\))-design existence problem and other related problems ⋮ On weights and quotas for weighted majority voting games ⋮ Multidimension: a dimensionality extension of simple games ⋮ Forms of representation for simple games: sizes, conversions and equivalences ⋮ On the characterization of weighted simple games ⋮ Separable and equatable hypergraphs ⋮ On shift stable hypergraphs ⋮ Threshold graphs, shifted complexes, and graphical complexes ⋮ Note on complexity of computing the domination of binary systems ⋮ Unnamed Item ⋮ Linear separation of connected dominating sets in graphs ⋮ Decomposing 1-Sperner hypergraphs ⋮ On the enumeration of Boolean functions with distinguished variables

Cites Work

• On an extension of Dijkstra's semaphore primitives
• A Graph-Theoretic Characterization of the $\text{PV}_{\text{chunk}}$ Class of Synchronizing Primitives
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Threshold hypergraphs