Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
Shortest path and maximum flow problems in planar flow networks with additive gains and losses
Saber Mirzaei, Assaf Kfoury
In contrast to traditional flow networks, in additive flow networks, to every edge e is assigned a gain factor g(e) which represents the loss or gain of the flow while using edge e…
cs.CC2016
Efficient Reassembling of Graphs, Part 2: The Balanced Case
Saber Mirzaei, Assaf Kfoury
The reassembling of a simple connected graph G = (V,E) is an abstraction of a problem arising in earlier studies of network analysis. The reassembling process has a simple formulat…