Izv. Vyssh. Uchebn. Zaved. Mat., 1980 Number 1, Pages 75–77
(Mi ivm4295)
|
Brief communications
A polynomial algorithm for finding minimal vertex coverings for a class of planar graphs
E. B. Kinber
UDC:
519.1 Received: 12.05.1978
English version:
Soviet Mathematics (Izvestiya VUZ. Matematika), 1980,
24:1,
98–100
Bibliographic databases:
© , 2024
Fulltext:
PDF file (275 kB)