TREE (3) is a colossus so large it dwarfs some of its numerically giant cousins—a quinquanonagintillion (10 to the 288th power), a googolplex (the number 1 followed by a googol zeros), a ...

Graph Reconfiguration: The process of transforming one valid solution of a graph problem into another by sequentially modifying elements while preserving prescribed constraints.

The graph isomorphism problem has been labeled as NP, though some have suggested it should be NP complete—it involves trying to create an algorithm able to look at two networks (with nodes and ...

An optimum rectilinear Steiner tree for a set A of points in the plane is a tree which interconnects A using horizontal and vertical lines of shortest possible total length. Such trees correspond to ...