Preprints. 2004
N198 (October)
About one multicriteria problem of selection of the greatest maximum paths on
prefractals graphs
Authors:
D.A.Pavlov., A.A.Kochkarov, A.A.Uzdenov
The paper is devoted to the multicriteria problem of a covering prefractals
graphs by intersected simple paths. An algorithm selecting a covering
consisting from the greatest maximum chains by prefractal (n,L)-graph
is represented, and this covering is optimum by criterion
F2(x) and estimated by remaining criteria.
All the algorithms are polynomial.
Keywords: prefractal (n,L)-graph, subgraph - seeding
agent, spanning subgraph, greatest maximum path.
Any questions to
webmaster
Last update: 26/12/2008
|
|
