9 citations · 27 across the 9 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2016★ 3 cited
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★ 1 cited
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…
cs.CC2016★ 1 cited
Minimum Average Delay of Routing Trees
Saber Mirzaei
The general communication tree embedding problem is the problem of mapping a set of communicating terminals, represented by a graph G, into the set of vertices of some physical net…