I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
type: Item
instance of: scholarly article
title: I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
zbMATH Open document ID: 1131.05316
DOI: 10.1007/11841036_49
author: Ulrich Meyer
author: Norbert Zeh
published in: Lecture Notes in Computer Science
publication date: 2008-03-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5247796
MaRDI profile type: MaRDI publication profile
full work available at URL: 11841036 49
OpenAlex ID: W1598859508
Recommended article: Algorithms - ESA 2003
Recommended article: I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
Recommended article: Via Detours to I/O-Efficient Shortest Paths
Recommended article: Q2934681
Recommended article: Design and Implementation of a Practical I/O-efficient Shortest Paths Algorithm
Recommended article: I/O Efficient Algorithms for the Minimum Cut Problem on Unweighted Undirected Graphs
Recommended article: I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs
Recommended article: Q4778563
Recommended article: Algorithm Theory - SWAT 2004
Recommended article: I/O-efficient path traversal in succinct planar graphs
description: scientific article; zbMATH DE number 5247796