Complexity of Connected Components in Evolving Graphs and the Computation of Multicast Trees in Dynamic Networks

This publication has 14 references indexed in Scilit:

• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
  International Journal of Foundations of Computer Science, 2003
• Datagram routing algorithm for LEO satellite networks
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Time-Expanded Graphs for Flow-Dependent Transit Times
  Published by Springer Nature ,2002
• Topological Design, Routing, and Handover in Satellite Networks
  Published by Wiley ,2002
• Merit
  Published by Association for Computing Machinery (ACM) ,2001
• A Distributed Algorithm for Minimum Weight Directed Spanning Trees
  IEEE Transactions on Communications, 1983
• Shortest route with time dependent length of edges and limited delay possibilities in nodes
  Mathematical Methods of Operations Research, 1977
• Shortest path with time constraints on movement and parking
  Networks, 1974
• An Appraisal of Some Shortest-Path Algorithms
  Operations Research, 1969
• Constructing Maximal Dynamic Flows from Static Flows
  Operations Research, 1958