scientific article; zbMATH DE number 6469141
From MaRDI portal
Publication:5501252
zbMath1317.68078MaRDI QIDQ5501252
Eric Lehman, April Rasala Lehman
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Source coding (94A29) Flows in graphs (05C21)
Related Items (5)
Distributed synthesis for well-connected architectures ⋮ Decidability of well-connectedness for distributed synthesis ⋮ A characterization of solvability for a class of networks ⋮ Rank-Metric Codes and Their Applications ⋮ A new method for ensuring anonymity and security in network coding
This page was built for publication:
