Maximum Flow Problems and an NP-complete variant on Edge Labeled Graphs