A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-319-18173-8_3

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer International Publishing

Related search

SPTH3: Subroutine for Finding Shortest Sabotage Paths

1977English

Finding K-Shortest Paths With Limited Overlap

VLDB Journal
HardwareInformation SystemsArchitecture
2020English

A Modified Genetic Algorithm for Finding Fuzzy Shortest Paths in Uncertain Networks

ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
2016English

On Finding and Updating Spanning Trees and Shortest Paths

SIAM Journal on Computing
MathematicsComputer Science
1975English

Efficient Determination of the K Most Vital Edges for the Minimum Spanning Tree Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2012English

Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

On Finding the Most Vital Job in Relocation Problem

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1994English

A New Algorithm for Finding the K Shortest Paths in a Time-Schedule Network With Constraints on Arcs

Journal of Algorithms and Computational Technology
Computational MathematicsApplied MathematicsNumerical Analysis
2016English

All Pairs Shortest Paths

An Elementary Approach to Design and Analysis of Algorithms
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy