For an acyclic directed network with multiple pairs of sources and sinks and a group of edge-disjoint paths connecting each pair of source and sink, it is known that the number of mergings among different groups of edge-disjoint paths is closely related to network encoding complexity. Using this connection, we derive exact values of and bounds on two functions relevant to encoding complexity for such networks.
Guangyue Han received the B.S. and M.S. degree in mathematics from Peking University, China, and the Ph.D. degree in mathematics from University of Notre Dame, U.S.A. in 1997, 2000 and 2004, respectively. After three years with the department of mathematics at University of British Columbia, Canada, he joined the department of mathematics at University of Hong Kong, China in 2007. His main research areas are analysis and combinatorics, with an emphasis on their applications to coding and information theory.
