Preprints. 2004
N200 (October)
About one multicriteria problem of a covering of a minimum weight prefractal
graph by simple intersected paths
Authors:
D.A.Pavlov., A.A.Kochkarov
The paper is devoted to the multicriteria problem of a covering prefractals
graphs by intersected simple paths. án algorithm selecting a covering on
prefractal (n,L)graph, optimum by criterion F_{1}(x)
and estimated by remaining criteria is represented. The proposed algorithm
is polynomial.
Keywords: prefractal (n,L)graph, subgraph  seeding agent,
spanning tree of a minimum weight.
Any questions to
webmaster
Last update: 26/12/2008

