Encyclopedia of Algorithms
From MaRDI portal
Publication:5899531
DOI10.1007/978-1-4939-2864-4zbMath1341.68001OpenAlexW2624930036MaRDI QIDQ5899531
No author found.
Publication date: 24 November 2015
Full work available at URL: https://doi.org/10.1007/978-1-4939-2864-4
Algorithms in computer science (68Wxx) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00)
Related Items (13)
A Retrospective on (Meta) Kernelization ⋮ A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem ⋮ Adapting the Directed Grid Theorem into an FPT Algorithm ⋮ Polynomial-delay and polynomial-space enumeration of large maximal matchings ⋮ Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm ⋮ Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay ⋮ Models in quantum computing: a systematic review ⋮ Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks ⋮ Hitting Minors on Bounded Treewidth Graphs. I. General Upper Bounds ⋮ Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding ⋮ Overall and delay complexity of the CLIQUES and Bron-Kerbosch algorithms ⋮ Unnamed Item ⋮ The exact multiple pattern matching problem solved by a reference tree approach
This page was built for publication: Encyclopedia of Algorithms
