Semi-dynamic breadth-first search in digraphs

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Theoretical Computer Science

• Publication date

  2001-01-06

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/S0304-3975(99)00132-2
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Dynamic Graph Algorithms

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

  1998cited by this paper
• Semidynamic Algorithms for Maintaining Single-Source Shortest Path Trees

  1998cited by this paper
• Undirected single source shortest paths in linear time

  1997cited by this paper
• Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs

  1997cited by this paper
• The Incremental Maintenance of a Depth-First-Search Tree in Directed Acyclic Graphs

  1997cited by this paper
• Maintaining a Topological Order Under Edge Insertions

  1996cited by this paper
• On the Computational Complexity of Dynamic Graph Problems

  1996cited by this paper
• Fully dynamic output bounded single source shortest path problem

  1996cited by this paper
• Fully dynamic biconnectivity and transitive closure

  1995cited 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
• Network Flows: Theory, Algorithms, and Applications

  1993cited by this paper
• Witnesses for Boolean matrix multiplication and for shortest paths

  1992cited by this paper
• On the all-pairs-shortest-path problem

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

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

  1990cited by this paper
• Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics

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

  1990cited by this paper
• Amortized Computational Complexity

  1985cited by this paper
• Updating distances in dynamic graphs

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

  1985cited by this paper
• Fibonacci heaps and their uses in improved network optimization algorithms

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

  1981cited by this paper
• Algorithmic graph theory and perfect graphs

  1980cited 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

• Computing-Aware Routing for LEO Satellite Networks: A Transmission and Computation Integration Approach

  2022cites this paper
• Updating of PageRank in Evolving Treegraphs

  2020cites this paper
• Shortest path algorithms for dynamic transportation networks

  2019cites this paper
• Providing Cloud Services to an Autonomous Robotic Car in Real-Time Traffic Environment

  2016cites this paper
• Incremental Test Generation Algorithms

  2015cites this paper
• On Dynamic DFS Tree in Directed Graphs

  2015cites this paper
• Systematic Prediction of Scaffold Proteins Reveals New Design Principles in Scaffold-Mediated Signal Transduction

  2015cites this paper
• Incremental Routing Algorithms For Dynamic Transportation Networks

  2006cites this paper
• Fast replanning for navigation in unknown terrain

  2005cites this paper
• Search-based planning for large dynamic environments

  2005cites this paper
• Incremental Heuristic Search in AI

  2004cites this paper
• Incremental Heuristic Search in Artificial Intelligence

  2004cites this paper
• Lifelong Planning A

  2004cites this paper
• Fully dynamic shortest paths in digraphs with arbitrary arc weights

  2003cites this paper
• Improved fast replanning for robot navigation in unknown terrain

  2002cites this paper