Abstract
Pseudo-Boolean methods are proposed for (1) recognizing whether a given signed graph is balanced, and (2) for constructing that (those) balanced graph(s), which are the “closest” to a given signed graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baumgarten, U. and P.L. Hammer: An Accelerated Method for Pseudo-Boolean Programming, (forthcoming).
Hammer, P.L. and U.N. Peled; On the Maximization of a Pseudo-Boolean Function, J. of the Assoc. Comp. Mach., 19, 1972, pp. 265–282.
Hammer, P.L. and S. Rudeanu: Boolean Methods in Operations Research and Related Areas. Springer-Verlag, Berlin-Heidelberg-New York, 1968.
Harary, F., R.Z. Norman, and D. Cartwright: Structural Models. An Introduction to the Theory of Directed Graphs. John Wiley and Sons, Inc., New York-London-Sidney, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1977 Springer Basel AG
About this chapter
Cite this chapter
Hammer, P.L. (1977). Pseudo-Boolean remarks on balanced graphs. In: Collatz, L., Meinardus, G., Wetterling, W. (eds) Numerische Methoden bei Optimierungsaufgaben Band 3. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série Internationale D’Analyse Numérique, vol 36. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-5936-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-0348-5936-3_5
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-5937-0
Online ISBN: 978-3-0348-5936-3
eBook Packages: Springer Book Archive