6 search results - page 2 / 2 » Steiner trees in uniformly quasi-bipartite graphs |
INFOCOM
2002
IEEE
14 years 8 days ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...