A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximation Algorithms for Graph Homomorphism Problems
[chapter]

2006
*
Lecture Notes in Computer Science
*

We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, find a mapping ϕ : VG → VH that maximizes the number of edges of G that are mapped to edges of H. This problem encodes various fundamental NP-hard problems including Maxcut and Max-k-cut. We also consider the multiway uncut problem. We are given a graph G and a set of terminals T ⊆ VG. We want to partition VG into |T | parts, each containing exactly one terminal, so as to maximize the number of

doi:10.1007/11830924_18
fatcat:xr642moslnckxjndlgpimcryte