8 search results - page 2 / 2 » A dichotomy for minimum cost graph homomorphisms |
CORR
2007
Springer
13 years 4 months ago
2007
Springer
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
AAIM
2005
Springer
13 years 10 months ago
2005
Springer
BIBE
2007
IEEE
13 years 11 months ago
2007
IEEE
Network mapping is a convenient tool for comparing and exploring biological networks; it can be used for predicting unknown pathways, fast and meaningful searching of databases, a...