4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.IT2013★ 1 cited
An Analysis on Minimum s-t Cut Capacity of Random Graphs with Specified Degree Distribution
Yuki Fujii, Tadashi Wadayama
The capacity (or maximum flow) of an unicast network is known to be equal to the minimum s-t cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link…
cs.IT2012★ 4 cited
A Coding Theoretic Approach for Evaluating Accumulate Distribution on Minimum Cut Capacity of Weighted Random Graphs
Tadashi Wadayama, Yuki Fujii
The multicast capacity of a directed network is closely related to the - maximum flow, which is equal to the - minimum cut capacity due to the max-flow min-cut theorem.…