Quasimonotone Boolean Functions and Bistellar Graphs

DOI10.1016/S0167-5060(08)70043-8MaRDI QIDQ3903040zbMATH OpenOpenAlexFDO

Authors Peter L. Hammer

Publication date 1980

Published in Combinatorics 79 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-5060(08)70043-8

zbMATH Keywords

bistellar graphBoolean functionsinteger quadratic programmingNP-completequadratic 0-1 optimization problemsstar graphs

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Integer programming (90C10) Quadratic programming (90C20)

Cited in

(7)

• Unimodular functions
• Bipartite dimensions and bipartite degrees of graphs
• On the supermodular knapsack problem
• On the stable set problem in special \(P_{5}\)-free graphs
• Pseudo-Boolean optimization
• Consensus algorithms for the generation of all maximal bicliques
• Computational complexity of norm-maximization

This page was built for publication: Quasimonotone Boolean Functions and Bistellar Graphs

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