Publication:5501252

From MaRDI portal

Revision as of 04:08, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

zbMath1317.68078MaRDI QIDQ5501252

Eric Lehman, April Rasala Lehman

Publication date: 3 August 2015

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90B18: Communication networks in operations research

90B10: Deterministic network models in operations research

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

94A29: Source coding

05C21: Flows in graphs

Related Items

A characterization of solvability for a class of networks, Distributed synthesis for well-connected architectures, Decidability of well-connectedness for distributed synthesis, A new method for ensuring anonymity and security in network coding

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5501252&oldid=30063963"