𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Improved algorithms for replacement paths problems in restricted graphs

✍ Scribed by Amit M. Bhosle

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
200 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Improved shortest path algorithms for ne
Improved shortest path algorithms for nearly acyclic graphs
✍ Shane Saunders; Tadao Takaoka πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 202 KB

Dijkstra's algorithm solves the single-source shortest path problem on any directed graph in O(m + n log n) time when a Fibonacci heap is used as the frontier set data structure. Here n is the number of vertices and m is the number of edges in the graph. If the graph is nearly acyclic, other algorit

Algorithms for the minimum partitioning
Algorithms for the minimum partitioning problems in graphs
✍ Hiroshi Nagamochi πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 545 KB

## Abstract In this paper, the author explains the recent evolution of algorithms for minimum partitioning problems in graphs. When the set of vertices of a graph having non‐negative weights for edges is divided into __k__ subsets, the set of edges for which both endpoints are contained in differen