Algorithmic aspects of the substitution decomposition in optimization over relations, set systems and Boolean functions
- 1 December 1985
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 4 (1), 195-225
- https://doi.org/10.1007/bf02022041
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- Decomposition of Directed GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- Partitive hypergraphsDiscrete Mathematics, 1981
- A Combinatorial Decomposition TheoryCanadian Journal of Mathematics, 1980
- On the X-join decomposition for undirected graphsDiscrete Applied Mathematics, 1979
- On certain polytopes associated with graphsJournal of Combinatorial Theory, Series B, 1975
- A Set Theoretic Treatment of Coherent SystemsSIAM Journal on Applied Mathematics, 1972
- On the composition and decomposition of cluttersJournal of Combinatorial Theory, Series B, 1971
- Clutter Decomposition and Monotonic Boolean FunctionsAnnals of the New York Academy of Sciences, 1970
- Modules of Coherent Binary SystemsJournal of the Society for Industrial and Applied Mathematics, 1965