Search
Now showing items 1-3 of 3
Guessing Games on Triangle-free Graphs
The guessing game introduced by Riis is a variant of the "guessing your own hats" game and can be played on any simple directed graph G on n vertices. For each digraph G, it is proved that there exists a unique guessing ...
Max-Flow Min-Cut Theorems for Multi-User Communication Networks
The paper presents four distinct new ideas and results for communication networks: 1) We show that relay-networks (i.e. communication networks where different nodes use the same coding functions) can be used to model dynamic ...