scholarly journals Multicut lower bounds via network coding

Author(s):  
Anna Blasiak
Keyword(s):  
2021 ◽  
pp. STOC19-87-STOC19-111
Author(s):  
Alireza Farhadi ◽  
MohammadTaghi Hajiaghayi ◽  
Kasper Green Larsen ◽  
Elaine Shi

Author(s):  
Jasper Goseling ◽  
Ryutaroh Matsumoto ◽  
Tomohiko Uyematsu ◽  
Jos H. Weber

2020 ◽  
Vol 63 (10) ◽  
pp. 97-105
Author(s):  
Alireza Farhadi ◽  
Mohammad Taghi Hajiaghayi ◽  
Kasper Green Larsen ◽  
Elaine Shi

10.37236/679 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Demetres Christofides ◽  
Klas Markström

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