๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Application of pseudo-Boolean programming to the theory of graphs

โœ Scribed by P. L. Ivanescu; I. Rosenberg


Publisher
Springer
Year
1964
Tongue
English
Weight
513 KB
Volume
3
Category
Article
ISSN
1432-2064

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Applications of pseudo-Boolean methods t
โœ Peter L. Hammer; Eliezer Shlifer ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Springer US ๐ŸŒ English โš– 410 KB

The use of Boolean algebra in logic, switching and automata theory, coding and other technically oriented areas is well known. The role of this paper is to show that Boolean algebra can be instrumental in taking economic decisions. By a pseudo-Boolean function, a real-valued function with bivalent

An application of graph theory to group
โœ H. Nencka-Ficek; T. Lulek ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 96 KB

An application of graph theory to group theory is presented. A problem of finding the eigenvectors for certain types of matrices is considered.

Pseudo bond graphs of circulating Fluids
โœ Mont Hubbard; John W. Brewer ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 934 KB

## Two different bond-graph schemes for the modeling of circulating fluids are discussed and compared. The first uses a heuristic approach wherein the flow path is broken into segments. Each segment has separate hydraulic and thermal submodels which are linked with active bonds. The model is general

Application of graph theory to the synth
โœ Shu-Park Chan ๐Ÿ“‚ Article ๐Ÿ“… 1965 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 965 KB

XBSTRACT : This paper considers one special type of switching network, namely, the singlecontact (SC) network. A minimal set of de~nitions is introduced, and several known theorems, which are useful in the later development, are stated without proof. Certain functional transformations are then deriv