Threshold Numbers and Threshold Completions

DOI10.1016/S0304-0208(08)73462-5MaRDI QIDQ5905060zbMATH OpenOpenAlexFDO

Authors Peter L. Hammer, Toshihide Ibaraki, Uri N. Peled

Publication date 1981

Published in North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73462-5

zbMATH Keywords

chromatic numberpositive Boolean functionthreshold subcollection

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Graph theory (05C99) Integer programming (90C10)

Cited in

(22)

• Complete simple games
• Some complexity results about threshold graphs
• Total matchings and total coverings of threshold graphs
• On the characterization of weighted simple games
• Sphere coverings of the hypercube with incomparable centers
• On data classification by iterative linear partitioning
• Simple games and magic squares
• On the geometric separability of Boolean functions
• On the enumeration of bipartite simple games
• Computational aspects of relaxation complexity
• Complexity of linear relaxations in integer programming
• Winning coalitions in plurality voting democracies
• Computational aspects of relaxation complexity: possibilities and limitations
• Bounds on Threshold Dimension and Disjoint Threshold Coverings
• Threshold Dimension of Graphs
• Representations of Boolean functions by systems of linear inequalities
• Estimating the efficiency of threshold representations of Boolean functions
• The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
• Complexity classification of some edge modification problems
• Algorithms and complexity of sandwich problems in graphs (extended abstract)
• Bipartite bithreshold graphs
• Cones of closed alternating walks and trails

This page was built for publication: Threshold Numbers and Threshold Completions

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