IEEE Transactions on Communications · 1993 · 42 citations · 6 references
Cluster ComputingEngineeringNetwork AnalysisNetwork SurvivabilityDynamic NetworkNetwork TopologiesSystems EngineeringNetwork OptimizationCombinatorial OptimizationNetwork FlowsDistributed OptimizationDistributed SystemsComputer ScienceFault-tolerant NetworkNetwork ScienceNetwork AlgorithmBusinessRobust RoutingNetwork ConnectivityNetwork Topology
An adaptive link assignment algorithm for the distributed optimization of dynamically changing network topologies is presented. The algorithm is responsible for determining the network connectivity by controlling the selection of links to be established and disconnected. This algorithm is designed to recover from predictable link outages as well as massive unpredictable failures. To minimize computational time complexity as well as to improve transient response. Some known graph-theoretic algorithms are utilized.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
6
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.5K citations
Depth-First Search and Linear Graph Algorithms
Robert E. Tarjan · SIAM Journal on Computing · 1972 · 5.9K citations