Live briefing
Everything about Reverse-search algorithm
Reverse-search algorithms are a class of algorithms for generating all objects of a given size, from certain classes of combinatorial objects. In many cases, these methods allow the objects to be generated in polynomial time per object, using only enough memory to store a constant number of objects. They work by organizing the objects to be generated into a spanning tree of their state space, and then performing a depth-first search of this tree. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Reverse-search algorithmA 5-minute orientation
- Skim a recent paper: Integrated Modeling of Hybrid Nanofiltration/Reverse Osmosis Desalination Plant Using Deep Learning-Based Crow Search Optimization AlgorithmInfluential work since 2022
- Pick up a classic book: Darwin's dangerous ideaThe most-reprinted book on the subject
- Read the landmark paper: A modified adaptive sparrow search algorithm based on chaotic reverse learning and spiral search for global optimizationCited 45 times
- Go sideways: Vertex enumeration problemA closely related topic
- Go sideways: David AvisA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A modified adaptive sparrow search algorithm based on chaotic reverse learning and spiral search for global optimization
Cuckoo Search Algorithm with Lévy Flights for Global-Support Parametric Surface Approximation in Reverse Engineering
Adding forward searching capabilities to a reverse search algorithm for unknown mass spectra
Computational experience with the reverse search vertex enumeration algorithm
PEMFC parameter identification using a Reverse-Search Chaos Differential-Evolution Whale Optimization Algorithm
Computational experience using an edge search algorithm for linear reverse convex programs
Chaos and elite reverse learning – Enhanced sparrow search algorithm for IIoT sensing communication optimization
A deep neural network based reverse radio spectrogram search algorithm
🆕 Influential since 2022
Integrated Modeling of Hybrid Nanofiltration/Reverse Osmosis Desalination Plant Using Deep Learning-Based Crow Search Optimization Algorithm
Reverse Maximum Inner Product Search: Formulation, Algorithms, and Analysis
A two-stage bidirectional coevolution algorithm with reverse search for constrained multiobjective optimization
Adaptive chaotic reverse learning-enhanced reptile search algorithm for efficient task scheduling in cloud computing
A reverse chain search algorithm for the resource constraint in deep space detectors
📚 Books worth reading
Darwin's dangerous ideaDaniel C. Dennett · 1995
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
Algorithms in computational molecular biologyMourad Elloumi · 2010
Classical and Quantum Information TheoryEmmanuel Desurvire · 2009
Data structures & algorithms in JavaRobert Lafore · 2003
AQA A-Level Computer ScienceBob Reeves · 2015
Network and Parallel ComputingJames J. Park · 2012
Emerging Technologies for Information Systems, Computing, and ManagementW. Eric Wong · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Vertex enumeration problem In mathematics, the vertex enumeration problem for a polytope, a polyhedral cell complex, a hyperplane arrangement, or some other object of discrete geometry…
- David Avis David Michael Avis (born March 20, 1951) is a Canadian and British computer scientist known for his contributions to geometric computations. Avis is a…
- Komei Fukuda Komei Fukuda (Japanese: 福田 公明, 1951 - July 27, 2026) was a Japanese mathematician known for his contributions to optimization, polyhedral computation and…
- Convex polytope A convex polytope is a special case of a polytope, having the additional property that it is also a convex set contained in the n-dimensional Euclidean…
- Spanning tree In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices of…
- Chordal graph In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not…
- Component (graph theory) In graph theory, a component of an undirected graph is a connected subgraph that is not part of any larger connected subgraph. The components of any graph…
- Glossary of graph theory Look up Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs,…