Encyclopedia of Algorithms
From MaRDI portal
Publication:5900149
DOI10.1007/978-0-387-30162-4zbMath1149.68078OpenAlexW1524920060MaRDI QIDQ5900149
No author found.
Publication date: 11 July 2008
Full work available at URL: https://doi.org/10.1007/978-0-387-30162-4
Algorithms in computer science (68Wxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Related Items (16)
Seeing Arboretum for the (partial k-) Trees ⋮ Pioneering the Establishment of the Foundations of the Internet of Things ⋮ A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs ⋮ Checking oriented matroid isomorphism by means of canonical labeling ⋮ Computing area in presentations of the trivial group ⋮ Robust and approximately stable marriages under partial information ⋮ Remarks on some misconceptions about unequal probability sampling without replacement ⋮ Landmark diffusion maps (L-dMaps): accelerated manifold learning out-of-sample extension ⋮ Bet-or-pass: adversarially robust Bloom filters ⋮ Greed is good for deterministic scale-free networks ⋮ Statistics ⋮ High-dimensional circular quantum secret sharing using orbital angular momentum ⋮ A GRASP algorithm for the closest string problem using a probability-based heuristic ⋮ From symmetry to asymmetry: generalizing TSP approximations by parametrization ⋮ Some problems in distributed computational geometry ⋮ An effective compact formulation of the max cut problem on sparse graphs
This page was built for publication: Encyclopedia of Algorithms
