5 citations · 5 across the 1 of their papers we have counts for
1 paper
Robert Engström, Tommy Färnqvist, Peter Jonsson +1
A graph homomorphism is a vertex map which carries edges from a source graph to edges in a target graph. The instances of the Weighted Maximum H-Colourable Subgraph problem (MAX H-…