Skip to main content

Some Remarks on Conflict Graphs of Quadratic Pseudo-Boolean Functions

  • Chapter
Konstruktive Methoden der finiten nichtlinearen Optimierung

Abstract

The recognition of “virtually quadratic” 0–1 optimization problems leads to the study of those graphs (quadratic graphs) whose edge-set can be covered by complete bipartite graphs so that each vertex belongs to at most two such complete bipartite graphs.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. BENZAKEN, P.L. HAMMER, B. SIMEONE: Quadratic graphs as adjoints of bidirected graphs. Presented at the 11th Southeastern Conference on Combinatorics, Graph Theory and Computing, Boca Raton, Florida, March 1980

    Google Scholar 

  2. C. BERGE: Graphes et hypergraphes (Dunod, Paris, 1972)

    Google Scholar 

  3. P.L. HAMMER, I.G. ROSENBERG: Linear decomposition of a positive group-boolean function. In: Numerische Methoden bei Optimierung, vol. II, L. Collatz and W. Wetterling (ed.), Birkhäuser Verlag, Basel, Stuttgart, 1974, 51–62

    Chapter  Google Scholar 

  4. P.L. HAMMER, B. SIMEONE: Quasimonotone boolean functions and bi-stellar graphs, Annals of Discrete Mathematics 1980 (forthcoming)

    Google Scholar 

  5. C. HEUCHENNE: Sur certaines correspondances entre graphes, Bull. Soc. Royale Sci. Liège 33 (1964) 743–753

    Google Scholar 

  6. J. KRAUSZ: Démonstration nouvelle d’un théorème de Whitney sur les réseaux, Math. Fiz. Lapok 50 (1943) 75–85

    Google Scholar 

  7. I.G. ROSENBERG: Reduction of unconstrained nonlinear 0–1 programming to the quadratic case, Cahiers du Centre d’Etudes de Rech. Operat. 17 (1975) 71–74

    Google Scholar 

  8. S. RUDEANU: Boolean functions and equations (North-Holland, Amsterdam) (1974)

    Google Scholar 

  9. B. SIMEONE: Quadratic boolean equations and the König-Egervàry property for graphs, forthcoming

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer Basel AG

About this chapter

Cite this chapter

Benzaken, C., Hammer, P.L., Simeone, B. (1980). Some Remarks on Conflict Graphs of Quadratic Pseudo-Boolean Functions. In: Collatz, L., Meinardus, G., Wetterling, W. (eds) Konstruktive Methoden der finiten nichtlinearen Optimierung. International Series of Numerical Mathematics / Internationale Schriftenreihe zur Numerischen Mathematik / Série internationale d’Analyse numérique, vol 55. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-6322-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-6322-3_1

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-6323-0

  • Online ISBN: 978-3-0348-6322-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics