Publication | Closed Access

Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths

Mathematical ProgrammingNetwork Routing AlgorithmEngineeringGraph TheoryNetwork AlgorithmRoute PlanningNetwork RoutingAll-pairs Shortest PathsComputational ComplexityComputer ScienceDiscrete MathematicsCombinatorial OptimizationTransitive ClosureGraph AlgorithmDecremental Algorithms