scientific article; zbMATH DE number 2081016
From MaRDI portal
Publication:4474117
zbMath1077.68728MaRDI QIDQ4474117
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2223/22230502.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05) Algorithms in computer science (68W99)
Related Items (5)
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs ⋮ Two-level heaps: a new priority queue structure with applications to the single source shortest path problem ⋮ A zero-space algorithm for negative cost cycle detection in networks ⋮ On contrasting vertex contraction with relaxation-based approaches for negative cost cycle detection ⋮ Via Detours to I/O-Efficient Shortest Paths
This page was built for publication:
