scientific article; zbMATH DE number 2242700
From MaRDI portal
Publication:5714531
zbMATH Open1096.68502MaRDI QIDQ5714531FDOQ5714531
Publication date: 3 January 2006
Title of this publication is not available (Why is that?)
Recommendations
- An efficient algorithm for constructing delay bounded minimum cost multicast trees
- A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks
- An Efficient Multicast Tree with Delay and Delay Variation Constraints
- A distance-heuristic tree building approach in application layer multicast
- A faster distributed protocol for constructing a minimum spanning tree
- A faster distributed protocol for constructing a minimum spanning tree
- Latency, capacity, and distributed minimum spanning trees
Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)
Cited In (9)
- Extending greedy multicast routing to delay sensitive applications
- A novel minimum delay maximum flow multicast algorithm to construct a multicast tree in wireless mesh networks
- A multicast routing algorithm based on searching in directed graph
- A low-latency and self-adapting application layer multicast
- PPPC--peer-2-peer streaming and algorithm for creating spanning trees for peer-2-peer networks
- Computational Science - ICCS 2004
- Minimizing Delay in Loss-Tolerant MAC Layer Multicast
- An efficient algorithm for constructing delay bounded minimum cost multicast trees
- Evaluating Steiner-tree heuristics and diameter variations for application layer multicast
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5714531)
