A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
Despite a steady improvement of computational hardware, results of numerical simulation are still tightly bound to the simulation tool and strategy used, and may substantially var...
The basic finite automata model has been extended over the years with different acceptance modes (nondeterminism, alternation), new or improved devices (two-way heads, pebbles, ...
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
The paper compares two popular strategies for solving propositional satis ability, backtracking search and resolution, and analyzes the complexity of a directional resolution algo...