Complexity of connected components in evolving graphs and the computation of multicast trees in dynamic networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2865, Issue , 2003, Pages 259-270

  Bhadra, Sandeep ^a   Ferreira, Afonso ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY MADRAS   (India)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; GRAPH THEORY; MULTICASTING; TOPOLOGY; TREES (MATHEMATICS); WIRELESS AD HOC NETWORKS;

COMMUNICATIONS NETWORKS; CONNECTED COMPONENT; DYNAMIC BEHAVIORS; DYNAMIC CHARACTERISTICS; MINIMUM SPANNING TREES; STRONGLY CONNECTED; STRONGLY CONNECTED COMPONENT; TEMPORAL VARIATION;

MOBILE AD HOC NETWORKS;

EID: 0142156669     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39611-6_23     Document Type: Article

References (20)

1. A. Borodin and R. El-Yaniv. Online computation and competitive analysis. Cambridge University Press, 1998.
2. B. Bui-Xuan, A. Ferreira, and A. Jarry. Computing shortest, fastest, and foremost journeys in dynamic networks. International Journal of Foundations of Computer Science, 14(2):267-285, April 2003.
3. Y. J. Chu and T. H. Liu. On the shortest arborescence of a directed graph. Science Sinica, 14:1396-1400, 1965.
4. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1990.
5. S.E. Dreyfus. An appraisal of Some Shortest-Path Algorithms. Operations Research, 17:269-271, 1969.
6. E. Ekici, I. F. Akyildiz, and M. D. Bender. Datagram routing algorithm for LEO satellite networks. In IEEE Infocom, pages 500-508, 2000.
7. A. Faragó and V.R. Syrotiuk. MERIT: A unified framework for routing protocol assessment in mobile ad hoc networks. In Proc. ACM Mobicom 01, pages 53-60. ACM, 2001.
8. A. Ferreira, J. Galtier, and P. Penna. Topological design, routing and handover in satellite networks. In I. Stojmenovic, editor, Handbook of Wireless Networks and Mobile Computing, pages 473-493. John Wiley and Sons, 2002.
9. L.R. Ford and D.R. Fulkerson. Constructing maximal dynamic flows from static flows. Operations Research, 6:419-433, 1958.
10. J. Halpern. Shortest route with time dependent length of edges and limited delay possibilities in nodes. Zeitschrift für Operations Research, 21:117-124, 1977.
11. J. Halpern and I. Priess. Shortest path with time constraints on movement and parking. Networks, 4:241-253, 1974.
12. P. A. Humblet. A distributed algorithm for minimum weight directed spanning trees. IEEE Transactions on Communications, COM-31(6):756-762, 1983.
13. E. Köhler, K. Langkau, and M. Skutella. Time-expanded graphs for flow-dependent transit times. In proc. ESA '02, 2002.
14. E. Köhler and M.Skutella. Flows over time with load-dependent transit times. In Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 174-183, 2002.
15. C. Scheideler. Models and techniques for communication in dynamic networks. In In H. Alt and A. Ferreira, editors, Proceedings of the 19th International Symposium on Theoretical Aspects of Computer Science, volume 2285, pages 27-49. Springer-Verlag, March 2002.
16. I. Stojmenovic, editor. Handbook of Wireless Networks and Mobile Computing. John Wiley & Sons, February 2002.
17. V. Syrotiuk and C. J. Colbourn. Routing in mobile aerial networks. In Proceedings of WiOpt'03 - Modeling and Optimization in Mobile, Ad-Hoc and Wireless Networks, pages 293-302, Sophia Antipolis, March 2003. INRIA.
18. R. E. Tarjan. Finding optimum branchings. Networks, pages 25-35, 1977.
19. P.-J. Wan, G. Calinescu, X. Li, and O. Frieder. Minimum-energy broadcast routing in static ad hoc wireless networks. In Proc. IEEE Infocom, pages 1162-1171, Anchorage, Alaska, 2001.
20. J. Wieselthier, G. Nguyen, and A. Ephremides. On the construction of energy-efficient broadcast and multicast trees in wireless networks. In Proc. IEEE Infocom, pages 585-594, Tel Aviv, 2000.