scientific article

From MaRDI portal

Revision as of 03:00, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4037436

Jump to:navigation, search

zbMath0765.68054MaRDI QIDQ4037436

Bernard M. E. Moret, Henry D. Shapiro

Publication date: 18 May 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Prim's algorithm priority queues Kruskal's algorithm binary heaps splay trees presorting Fibonacci heaps pairing heaps Cheriton and Tarjan's algorithm demand sorting Fredman and Tarjan's algorithm rank-relaxed heaps sacks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Unnamed Item ⋮ Pairing heaps: the forward variant. ⋮ A generalization of binomial queues ⋮ On sorting, heaps, and minimum spanning trees ⋮ Blossom V: A new implementation of a minimum cost perfect matching algorithm

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4037436&oldid=17755346"