Logo (Main page)
Special Astrophysical Observatory RAS

   About us      Divisions     Telescopes     Science     Publications     Education     Service     Contacts  

Preprints. 2004

N199 (October)
Algorithms of solutiom of the multicriteria problem of a covering prefractals graphs by non-intersected simple path
Authors: D.A.Pavlov., R.A.Kochkarov

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.

Any questions to  webmaster 
Last update: 26/12/2008