|
Zapiski Nauchnykh Seminarov LOMI, 1977, Volume 68, Pages 26–29
(Mi znsl1998)
|
|
|
|
Problem of path connections in graphs
D. Yu. Grigor'ev
Abstract:
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.
Citation:
D. Yu. Grigor'ev, “Problem of path connections in graphs”, Theoretical application of methods of mathematical logic. Part II, Zap. Nauchn. Sem. LOMI, 68, "Nauka", Leningrad. Otdel., Leningrad, 1977, 26–29; J. Soviet Math., 15:1 (1981), 14–16
Linking options:
https://www.mathnet.ru/eng/znsl1998 https://www.mathnet.ru/eng/znsl/v68/p26
|
Statistics & downloads: |
Abstract page: | 140 | Full-text PDF : | 83 |
|