On one algorithm of covering a graph by heterogeneous chains

N.A. Likholat (Dnipropetrovsk State University)

Abstract


In the paper, we propose the algorithm of covering a graph by chains of types that satisfy bounds for length and total weight of a chain.

References


Makarov G.D., Likholat N.A. "On one extremal problem on graphs", In: Comp. and Appl. Math., KGU, 1977; 34. (in Russian)

Likholat N.A. "On one problem about covering a graph by the set of minimal cardinality", Res. Math., 1976. (in Russian)

Little J. et al. "Algorithm to solve a traveling salesman problem", Economics and math. methods, 1965; 1(1). (in Russian)




DOI: https://doi.org/10.15421/247731

  

Refbacks

  • There are currently no refbacks.


Copyright (c) 1977 N.A. Likholat

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.


Registered in


ISSN (Online): 2664-5009
ISSN (Print): 2664-4991
DNU