Skip to main content

and
  1. No Access

    Article

    Inverse Polymatroidal Flow Problem

    Let D = (V, A) be a directed graph, for each vertex v ∈ V, let Δ+(v) and Δ (v) denote the sets of arcs leaving and entering v, $${\m...

    Mao-Cheng Cai, **aoguang Yang, Yanjun Li in Journal of Combinatorial Optimization (1999)