Threshold Numbers and Threshold Completions
From MaRDI portal
Publication:5905060
DOI10.1016/S0304-0208(08)73462-5zbMath0482.05060OpenAlexW1597014679MaRDI QIDQ5905060
Uri N. Peled, Toshihide Ibaraki, Peter L. Hammer
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
Related Items
Some complexity results about threshold graphs, Total matchings and total coverings of threshold graphs, On data classification by iterative linear partitioning, Simple games and magic squares, Complexity of linear relaxations in integer programming, Estimating the efficiency of threshold representations of Boolean functions, Representations of Boolean functions by systems of linear inequalities, Threshold Dimension of Graphs, On the geometric separability of Boolean functions, Cones of closed alternating walks and trails, Recognizing simple-triangle graphs by restricted 2-chain subgraph cover, Algorithms and complexity of sandwich problems in graphs (extended abstract), On the characterization of weighted simple games, Computational aspects of relaxation complexity: possibilities and limitations, Winning coalitions in plurality voting democracies, Bipartite bithreshold graphs, Bounds on Threshold Dimension and Disjoint Threshold Coverings, Complexity classification of some edge modification problems, On the enumeration of bipartite simple games, Sphere coverings of the hypercube with incomparable centers, Computational aspects of relaxation complexity, Complete simple games, The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial
