Title: Some Remarks on Conflict Graphs of Quadratic Pseudo-Boolean Functions
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.
Publication Year: 1980
Publication Date: 1980-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 6
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot