Constraint Composite Graph

Constraint Composite Graph

Edited by 

List price: US$38.00

Currently unavailable

Add to wishlist

AbeBooks may have this title (opens in new window).

Try AbeBooks


Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The constraint composite graph is a node-weighted undirected graph associated with a given combinatorial optimization problem posed as a weighted constraint satisfaction problem. Developed and introduced by Satish Kumar Thittamaranahalli, the idea of the constraint composite graph is a big step towards unifying different approaches for exploiting "structure" in weighted constraint satisfaction problems. A weighted constraint satisfaction problem is a generalization of a constraint satisfaction problem in which the constraints are no longer "hard," but are extended to specify non-negative costs associated with the more

Product details

  • Paperback | 64 pages
  • 152 x 229 x 4mm | 104g
  • String Publishing
  • United States
  • English
  • black & white illustrations
  • 6136280027
  • 9786136280028