A Graph Theoretical Approach to Network Encoding Complexity

作者：Xu Easton Li^*; Shang Weiping; Han Guangyue

来源：International Symposium on Information Theory and its Applications (ISITA), 2012-10-28 to 2012-10-31.

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.

• 出版日期2012
• 单位香港大学