Probl. Peredachi Inf., 1976 Volume 12, Issue 2, Pages 76–82
(Mi ppi1689)
|
Large Systems
Covering a Finite Graph by a Minimum Number of of Forests
V. P. Polesskii
Abstract:
The author proposes an algorithm that provides minimum covering of a finite graph by forests.
UDC:
21.395.74:519.14
Received: 10.08.1972
Revised: 25.10.1974
English version:
Problems of Information Transmission, 1976,
12:4,
141–146
Bibliographic databases:
© , 2025
Fulltext:
PDF file (1354 kB)