Login / Signup

On the Coding Advantage of Multiple Unicast Sessions in Undirected Graphs.

Kamal JainVijay V. VaziraniGideon Yuval
Published in: ITW (2006)
Keyphrases
  • undirected graph
  • coding scheme
  • directed acyclic graph
  • spanning tree
  • computational complexity
  • approximation algorithms
  • vertex set