Network coding in undirected graphs is either very helpful or not helpful at all (Q4638067): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the capacity of information networks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Network information flow / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3056948 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lexicographic Products and the Power of Non-linear Network Coding / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Network Coding Applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs of prescribed girth and bi-degree / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3547061 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3499280 / rank | |||
Normal rank |
Latest revision as of 14:04, 15 July 2024
scientific article; zbMATH DE number 6866308
Language | Label | Description | Also known as |
---|---|---|---|
English | Network coding in undirected graphs is either very helpful or not helpful at all |
scientific article; zbMATH DE number 6866308 |
Statements
3 May 2018
0 references
network coding
0 references
gap amplification
0 references
multicommodity flows
0 references
cs.IT
0 references
math.IT
0 references
0 references