Reverse-search algorithm

A reverse-search algorithm generates the combinatorial objects in a state space, an implicit graph whose vertices are the objects to be listed and whose edges represent certain "local moves" connecting pairs of objects, typically by making small changes to their structure. It finds each objects using a depth-first search in a rooted spanning tree of this state space, described by the following information:[2]

• The root of the spanning tree, one of the objects
• A subroutine for generating the parent of each object in the tree, with the property that if repeated enough times it will eventually reach the root
• A subroutine for listing all of the neighbors in the state space (not all of which may be neighbors in the tree)

From this information it is possible to find the children of any given node in the tree, reversing the links given by the parent subroutine: they are simply the neighbors whose parent is the given node. It is these reversed links to child nodes that the algorithm searches.[2]

A classical depth-first search of this spanning tree would traverse the tree recursively, starting from the root, at each node listing all of the children and making a recursive call for each one. Unlike a depth-first search of a graph with cycles, it is not necessary to maintain the set of already-visited nodes to avoid repeated visits; such repetition is not possible in a tree. However, this recursive algorithm may still require a large amount of memory for its call stack, in cases when the tree is very deep. Instead, reverse search traverses the spanning tree in the same order while only storing two objects: the current object of the traversal, and the previously traversed object. Initially, the current object is set to the root of the tree, and there is no previous object. From this information, it is possible to determine the next step of the traversal by the following case analysis:[2]

• If there is no previous object, or the previous object is the parent of the current object, then this is the first time the traversal has reached the current object, so it is output from the search. The next object is its first child or, if it has no children, its parent.
• In all other cases, the previous object must be a child of the current object. The algorithm lists the children (that is, state-space neighbors of the current object that have the current object as their parent) one at a time until reaching this previous child, and then takes one more step in this list of children. If another child is found in this way, it is the next object. If there is no next child and the current object is not the root, the next object is the parent of the current object. In the remaining case, when there is no next child and the current object is the root, the reverse search terminates.

This algorithm involves listing the neighbors of an object once for each step in the search. However, if there are ${\displaystyle N}$ objects to be listed, then the search performs ${\displaystyle 2N-1}$ steps, so the number of times it generates neighbors of objects is within a factor of two of the number of times the recursive depth-first search would do the same thing.[2]

Examples of the problems to which reverse search has been applied include the following combinatorial generation problems:

Vertices of simple convex polytopes

If a ${\displaystyle d}$-dimensional convex polytope is defined as an intersection of half-spaces, then its vertices can be described as the points of intersection of ${\displaystyle d}$ or more hyperplanes bounding the halfspaces; it is a simple polytope if no vertex is the intersection of more than ${\displaystyle d}$ of these hyperplanes. The vertex enumeration problem is the problem of listing all of these vertices. The edges of the polytope connect pairs of vertices that have ${\displaystyle d-1}$ hyperplanes in common, so the vertices and edges form a state space in which each vertex has ${\displaystyle d}$ neighbors. The simplex algorithm from the theory of linear programming finds a vertex maximizing a given linear function of the coordinates, by walking from vertex to vertex, choosing at each step a vertex with a greater value of the function; there are several standard choices of "pivot rule" that specify more precisely which vertex to choose. Any such pivot rule can be interpreted as defining the parent function of a spanning tree of the polytope, whose root is the optimal vertex. Applying reverse search to this data generates all vertices of the polytope. A similar algorithm can also enumerate all bases of a linear program, without requiring that it defines a polytope that is simple.[2][3]

Cells of hyperplane arrangements

A hyperplane arrangement decomposes Euclidean space into cells, each described by a "sign vector" that describes whether its points belong to one of the hyperplanes (sign 0), are on one side of the hyperplane (sign +1), or are on the other side (sign −1). The cells form a connected state space under local moves that change a single sign by one unit, and it is possible to check that this operation produces a valid cell by solving a linear programming feasibility problem. A spanning tree can be constructed for any choice of root cell by defining a parent operator that makes the first possible change that would bring the sign vector closer to that of the root. Using reverse search for this state space and parent operator produces an algorithm for listing all cells in polynomial time per cell.[2][4]

Point-set triangulations

The triangulations of a planar point set are connected by "flip" moves that remove one diagonal from a triangulation and replace it by another. If the Delaunay triangulation is chosen as the root, then every triangulation can be flipped to the Delaunay triangulation by steps in which the triangulation of some subset of four points is replaced by its Delaunay triangulation.[5][6] Choosing the first Delaunay flip as the parent of each triangulation, and applying local search, produces an algorithm for listing all triangulations in polynomial time per triangulation.[2]

Connected subgraphs

The connected subgraphs, and connected induced subgraphs, of a given connected graph form a state space whose local moves are the addition or removal of a single edge or vertex of the graph, respectively. A spanning tree of this state space can be obtained by adding the first edge or vertex (in some ordering of the edges or vertices) whose addition produces another connected subgraph; its root is the whole graph. Applying local search to this state space and parent operator produces an algorithm for listing all connected subgraphs in polynomial time per subgraph.[2]

Other applications include algorithms for generating the following structures:

• Polyominos,[7] polyiamond prototiles,[8] and polyhex (mathematics) hydrocarbon molecules.[9]
• Topological orderings of directed acyclic graphs, using a state space whose local moves reverse the ordering of two elements.[2]
• Spanning trees of graphs, non-crossing spanning trees of planar point sets, and more generally bases of matroids, using a state space that swaps one edge for another.[2]
• Euler tours in graphs.[10]
• The maximal independent sets of sparse graphs.[11]
• Maximal planar graphs[12] and polyhedral graphs.[13]
• Non-crossing minimally rigid graphs on a given point set.[14]
• Surrounding polygons, polygons that have some of a given set of points as vertices and surround the rest, using a state space that adds or removes one vertex of the polygon.[15]
• Vertices or facets of the Minkowski sum of convex polytopes.[16][17]
• The corners (multidegrees) of monomial ideals.[18]