scientific article; zbMATH DE number 1962826
From MaRDI portal
Publication:4418662
zbMath1035.68082MaRDI QIDQ4418662
Amit M. Bhosle, J. E. Hershberger, Subhash Suri
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070343.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Approximate shortest paths avoiding a failed vertex: near optimal data structures for undirected unweighted graphs ⋮ Improved algorithms for replacement paths problems in restricted graphs ⋮ Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs ⋮ Finding an anti-risk path between two nodes in undirected graphs ⋮ Finding the anti-block vital edge of a shortest path between two nodes ⋮ Incremental distance products via faulty shortest paths
This page was built for publication:
