EXISTENTIAL MAPPING ALGORITHM FOR CLOSED SYSTEMS

Richard Krajčoviech - Margaréta Kotočová

   The paper presents a mapping algorithm based on systematic depth-first searching of the solution space. The presented algorithm is independent of the architecture of both the hardware and software. There is a thesis usable for estimation of its complexity together with its experimental test in the paper. Based on the thesis the class of mapping problems with linear complexity is stated.

Keywords: mapping, depth-first search, complexity

[full-paper]