Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs

No abstract is available for this paper.

• Publication year

  1997

• Venue

  Symposium on Theoretical Aspects of Computer Science

• Publication date

  1997-02-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/BFb0023446
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fully dynamic output bounded single source shortest path problem

  1996cited by this paper
• Shortest Path Queries in Digraphs of Small Treewidth

  1995cited by this paper
• Faster shortest-path algorithms for planar graphs

  1994cited by this paper
• Incremental Algorithms for the Single-Source Shortest Path Problem

  1994cited by this paper
• On the Structure of DFS-Forests on Directed Graphs and the Dynamic Maintenance of DFS on DAG's

  1994cited by this paper
• On-line Graph Algorithms for Incremental Compilation

  1993cited by this paper
• Network Flows: Theory, Algorithms, and Applications

  1993cited by this paper
• A Fully Dynamic Approximation Scheme for All-Pairs Shortest Paths in Planar Graphs

  1993cited by this paper
• Dynamic algorithms for shortest paths in planar graphs

  1991cited by this paper
• Graph Algorithms

  1991cited by this paper
• Recognizing Breadth-First Search Trees in Linear Time

  1990cited by this paper
• Incremental algorithms for minimal length paths

  1990cited by this paper
• Recognizing breadth-first search trees in linear time

  1990cited by this paper
• A Dynamization of the All Pairs Least Cost Path Problem

  1985cited by this paper
• Updating distances in dynamic graphs

  1985cited by this paper
• Amortized Computational Complexity

  1985cited by this paper
• Shortest path problems in planar graphs

  1983cited by this paper
• An On-Line Edge-Deletion Problem

  1981cited by this paper
• A Separator Theorem for Planar Graphs

  1977cited by this paper
• A note on two problems in connexion with graphs

  1959cited by this paper

• IGP Convergence Optimization with AI

  2024cites this paper
• Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights

  2019cites this paper
• A Retroactive Approach for Dynamic Shortest Path Problem

  2018cites this paper
• Green backbone routing.

  2016cites this paper
• Benchmarking a recurrent neural network based efficient shortest path problem (SPP) solver concept under difficult dynamic parameter settings conditions

  2016cites this paper
• Efficient Parallel Implementation of the Ramalingam Decremental Algorithm for Updating the Shortest Paths Subgraph

  2013cites this paper
• Finding large $$k$$-clubs in undirected graphs

  2013influential citation
• Dynamic distributed algorithm for computing multiple next-hops on a tree

  2013cites this paper
• Effects of OSPF Timers Configurations on Network Convergence in New Generation Routers

  2013cites this paper
• Survey on features of millimeter wave communication networks

  2013cites this paper
• Parallel multicast overlay networks with probabilistic path selection

  2012cites this paper
• Dynamic Graph Shortest Path Algorithm

  2012cites this paper
• Using Genetic Algorithms for Navigation Planning in Dynamic Environments

  2012cites this paper
• Improving Convergence Speed and Scalability in OSPF: A Survey

  2012cites this paper
• Parallel implementation of the Ramalingam decremental algorithm for dynamic updating the single-sink shortest paths subgraph

  2009cites this paper
• An efficient pursuit automata approach for estimating stable all‐pairs shortest paths in stochastic network environments

  2009cites this paper
• Shortest Path Routing Algorithms in Multihop Networks

  2009cites this paper
• Performance evaluation for asynchronous MC-CDMA systems with a symbol timing offset

  2009cites this paper
• Navigation and Guidance Planning for Air Vehicles

  2008cites this paper
• Multicast algorithms in service overlay networks

  2008cites this paper
• A heuristic approach to military transition problem

  2008cites this paper
• A Stochastic Approach To Solving The Weight Setting Problem in OSPF Networks

  2007cites this paper
• The Pursuit Automaton Approach for Estimating All-Pairs Shortest Paths in Dynamically Changing Networks

  2007cites this paper
• Associative parallel algorithm for dynamic reconstruction of the shortest paths tree after insertion of a vertex

  2007cites this paper
• Modelos e algoritmos de cabeamento de redes telefonicas

  2007cites this paper
• Design of a Resilient and Customizable Routing Architecture

  2007cites this paper
• Achieving convergence-free routing using failure-carrying packets

  2007cites this paper
• An efficient dynamic algorithm for maintaining all-pairs shortest paths in stochastic networks

  2006cites this paper
• Aggregation Tree Routing Algorithm for Dynamic Topology in Large Scale Networks

  2005cites this paper
• Dynamic algorithms for the shortest path routing problem: learning automata-based solutions

  2005cites this paper
• New algorithms for maintaining all-pairs shortest paths

  2005cites this paper
• Generalized pursuit learning algorithms for shortest path routing tree computation

  2004cites this paper
• Innovations in Applied Artificial Intelligence

  2004cites this paper
• GPSPA: a new adaptive algorithm for maintaining shortest path routing trees in stochastic networks

  2004cites this paper
• Incremental Heuristic Search in AI

  2004cites this paper
• Failure insensitive routing for ensuring service availability

  2003cites this paper
• Dynamic routing protocols for anycast packet forwarding

  2003cites this paper
• Cached shortest-path tree: An approach to reduce the influence of intra-domain routing instability

  2003cites this paper
• Fast restoring gigabit wireless networks using a directional mesh architecture

  2003cites this paper
• Achieving faster failure detection in OSPF networks

  2003cites this paper
• Internet traffic engineering: qos translation and survivability

  2003cites this paper
• Fortifying OSPF/IS-IS against link-failure

  2001cites this paper
• Semi-dynamic breadth-first search in digraphs

  2001cites this paper
• Universit a Degli Studi Di Roma \la Sapienza" Fully Dynamic Algorithms for Path Problems on Directed Graphs Fully Dynamic Algorithms for Path Problems on Directed Graphs

  2001cites this paper
• Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study

  2000cites this paper
• New dynamic algorithms for shortest path tree computation

  2000cites this paper
• Routing reconfiguration in ip networks

  2000cites this paper
• Towards Milli-Second IGP Convergence

  2000cites this paper
• New Dynamic Algorithms for Shortest Computation

  2000cites this paper
• Implementations and Experimental Studies of Dynamic Graph Algorithms

  2000cites this paper
• New dynamic SPT algorithm based on a ball-and-string model

  1999cites this paper
• Fully Dynamic Shortest Paths and Negative Cycles Detection on Digraphs with Arbitrary Arc Weights

  1998cites this paper
• Experimental analysis of dynamic algorithms for the single source shortest paths problem

  1998cites this paper
• Experimental Analysis of Dynamic Algorithms for the Single Source Shortest Path Problem

  1997cites this paper
• Decremental Maintenance of Reachability in Hypergraphs and Minimum Models of Horn Formulae

  1997influential citation
• Decoupling Connectivity from Routing

  year unknowncites this paper