1. Science
  2. Publications
  3. Information Processing Systems
  4. 1(17)'2002
  5. An algorithm of synthesis of minimum covering tree on an arbitrary group of connected graph nodes

An algorithm of synthesis of minimum covering tree on an arbitrary group of connected graph nodes

A.V. Kuznetsov, V.N. Batsamut
Annotations languages:

The article deals with the exact polynomial algorithm of minimum covering tree building on an arbitrary set of initial single-component graph nodes
Reference:
Kuznetsov, O.V. and Batsamut, V.M. (2002), "Alhorytm syntezu minimalnoho pokryvaiuchoho dereva na dovilnii hrupi vershyn zv‘iaznoho hrafa" [An algorithm of synthesis of minimum covering tree on an arbitrary group of connected graph nodes], Information Processing Systems, Vol. 1(17), pp. 129-134.