scholarly journals Multicut lower bounds via network coding

2013 ◽  
Author(s):  
Anna Blasiak
Keyword(s):  
Network Coding ◽  
Lower Bounds

scholarly journals Lower Bounds for External Memory Integer Sorting via Network Coding

2021 ◽  
pp. STOC19-87-STOC19-111
Author(s):  
Alireza Farhadi ◽  
MohammadTaghi Hajiaghayi ◽  
Kasper Green Larsen ◽  
Elaine Shi
Keyword(s):  
Network Coding ◽  
Lower Bounds ◽  
External Memory ◽  
Integer Sorting

scholarly journals Lower Bounds on the Maximum Energy Benefit of Network Coding for Wireless Multiple Unicast

2010 ◽  
Vol 2010 (1) ◽  
Author(s):  
Jasper Goseling ◽  
Ryutaroh Matsumoto ◽  
Tomohiko Uyematsu ◽  
Jos H. Weber
Keyword(s):  
Network Coding ◽  
Lower Bounds ◽  
Maximum Energy

scholarly journals Lower bounds for external memory integer sorting via network coding

2020 ◽  
Vol 63 (10) ◽  
pp. 97-105
Author(s):  
Alireza Farhadi ◽  
Mohammad Taghi Hajiaghayi ◽  
Kasper Green Larsen ◽  
Elaine Shi
Keyword(s):  
Network Coding ◽  
Lower Bounds ◽  
External Memory ◽  
Integer Sorting

scholarly journals The Guessing Number of Undirected Graphs

10.37236/679 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Demetres Christofides ◽  
Klas Markström
Keyword(s):  
Network Coding ◽  
Chromatic Number ◽  
Lower Bounds ◽  
Perfect Graphs ◽  
Upper And Lower Bounds ◽  
Undirected Graphs ◽  
Fractional Chromatic Number ◽  
Winning Probability ◽  
Optimal Bounds

Riis [Electron. J. Combin., 14(1):R44, 2007] introduced a guessing game for graphs which is equivalent to finding protocols for network coding. In this paper we prove upper and lower bounds for the winning probability of the guessing game on undirected graphs. We find optimal bounds for perfect graphs and minimally imperfect graphs, and present a conjecture relating the exact value for all graphs to the fractional chromatic number.

Sign in / Sign up

Export Citation Format

Share Document