scientific article; zbMATH DE number 5455109

MaRDI QIDQ3547792zbMATHFDO

Authors

Publication date 21 December 2008

zbMATH Keywords

routingnetwork codingSteiner treemulticastFlow

Mathematics Subject Classification ID

Trees (05C05) Coding theorems (Shannon theory) (94A24) Circuits, networks (94C99) Communication networks in operations research (90B18)

Recommendations

• Packing trees in communication networks
• Bounding the Coding Advantage of Combination Network Coding in Undirected Networks
• A Reduction Approach to the Multiple-Unicast Conjecture in Network Coding
• The encoding complexity of network coding
• A computational perspective on network coding
• Capacity of a Class of Multicast Tree Networks
• Network Coding for Computing: Cut-Set Bounds
• Network Coding: A Computational Perspective
• Application of coding theory to interconnection networks
• Pruning Network Coding Traffic by Network Coding—A New Class of Max-Flow Algorithms

Cited in

(3)

• Max-flow min-cut theorems on dispersion and entropy measures for communication networks
• scientific article; zbMATH DE number 2127867 (Why is no real title available?)
• On the capacity of multiple unicast sessions in undirected graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547792)