Improved algorithms for replacement paths problems in restricted graphs (Q2488196): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2004.08.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2164276198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trans-dichotomous algorithms for minimum spanning trees and shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for K shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster shortest-path algorithms for planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer priority queues with decrease key in constant time and the single source shortest paths problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:33, 10 June 2024

scientific article
Language Label Description Also known as
English
Improved algorithms for replacement paths problems in restricted graphs
scientific article

    Statements

    Improved algorithms for replacement paths problems in restricted graphs (English)
    0 references
    0 references
    25 August 2005
    0 references
    0 references
    Replacement paths
    0 references
    Most vital arcs
    0 references
    Single link failure recovery
    0 references
    Minimum spanning trees sensitivity
    0 references
    0 references