Preprints. 2004

Algorithms of solutiom of the multicriteria problem of a covering prefractals graphs by non-intersected simple path

The paper is devoted to the multicriteria problem of covering prefractals graphs by non-intersecting simple chains. Algorithms selecting a covering, optimum by particular criteria and estimated according to remaining criteria, are represented. All the algorithms are polynomial.

Keywords: prefractal (n,L)-graph, subgraph - seeding agent, matching.