Lexicographic Products and the Power of Non-linear Network Coding

DOI10.1109/FOCS.2011.39zbMath1292.68010arXiv1108.2489OpenAlexW2081008934MaRDI QIDQ5494990

Anna Blasiak, Eyal Lubetzky, Robert D. Kleinberg

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1108.2489

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items (4)

A survey on hypergraph products ⋮ Constructing edge-disjoint Steiner paths in lexicographic product networks ⋮ On abelian and homomorphic secret sharing schemes ⋮ Network coding in undirected graphs is either very helpful or not helpful at all

This page was built for publication: Lexicographic Products and the Power of Non-linear Network Coding