Complexity classification of network information flow problems
From MaRDI portal
Flows in graphs (05C21) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Source coding (94A29)
Recommendations
Cited in
(22)- Representations of the multicast network problem
- Decidability of well-connectedness for distributed synthesis
- A computational perspective on network coding
- A new method for ensuring anonymity and security in network coding
- Network encoding complexity: exact values, bounds, and inequalities
- Cut-Set Bounds on Network Information Flow
- Polynomial-Time Construction of Linear Network Coding
- Insufficiency of Linear Coding in Network Information Flow
- Unachievability of network coding capacity
- Information flow decomposition for network coding
- The encoding complexity of network coding
- Reversible and Irreversible Information Networks
- The serializability of network codes
- Information Flows in Complex Networks
- Linear-code multicast on parallel architectures
- A characterization of solvability for a class of networks
- Network information flow
- Revisiting the linear information flow algorithm
- Optimal and heuristic network coding algorithms for multi-layered video broadcast
- Structural routability of n-pairs information networks
- Rank-metric codes and their applications
- Distributed synthesis for well-connected architectures
This page was built for publication: Complexity classification of network information flow problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501252)
