CORR
2010
Springer
13 years 11 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...
CSR
2009
Springer
14 years 6 months ago
2009
Springer
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f : V (G) → V (H) such that if uv ∈ E(G) then f(u)f(v) ∈ E(H). The pro...