scientific article; zbMATH DE number 1984681

zbMATH Open1024.68759MaRDI QIDQ4428992FDOQ4428992

Ulrich Meyer, Irit Katriel

Publication date: 22 September 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2625/26250062.htm

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Searching and sorting (68P10)

Cited In (3)

• Approximate shortest paths guided by a small index
• Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
• Priority queues with decreasing keys

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4428992)