scientific article; zbMATH DE number 1984681
From MaRDI portal
Publication:4428992
zbMath1024.68759MaRDI QIDQ4428992
Publication date: 22 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2625/26250062.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Computing methodologies and applications (68U99) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
Approximate shortest paths guided by a small index ⋮ Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
This page was built for publication:
