Zapiski Nauchnykh Seminarov POMI, Theoretical application of methods of mathematical logic. Part II, Tome 68 (1977), pp. 26-29
Citer cet article
D. Yu. Grigor'ev. Problem of path connections in graphs. Zapiski Nauchnykh Seminarov POMI, Theoretical application of methods of mathematical logic. Part II, Tome 68 (1977), pp. 26-29. http://geodesic.mathdoc.fr/item/ZNSL_1977_68_a2/
@article{ZNSL_1977_68_a2,
author = {D. Yu. Grigor'ev},
title = {Problem of path connections in graphs},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {26--29},
year = {1977},
volume = {68},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1977_68_a2/}
}
TY - JOUR
AU - D. Yu. Grigor'ev
TI - Problem of path connections in graphs
JO - Zapiski Nauchnykh Seminarov POMI
PY - 1977
SP - 26
EP - 29
VL - 68
UR - http://geodesic.mathdoc.fr/item/ZNSL_1977_68_a2/
LA - ru
ID - ZNSL_1977_68_a2
ER -
%0 Journal Article
%A D. Yu. Grigor'ev
%T Problem of path connections in graphs
%J Zapiski Nauchnykh Seminarov POMI
%D 1977
%P 26-29
%V 68
%U http://geodesic.mathdoc.fr/item/ZNSL_1977_68_a2/
%G ru
%F ZNSL_1977_68_a2
A generalization is considered of a problem that arises in the design of electronic equipment – the tracing of printed circuits. The generalization is proved to be $NP$-complete in the sense sused by Cook and Karp.
