Maximum flow problems and an np-complete variant on edge-labeled graphs