Abstract
This paper provides a proof of NP-completeness of the problem of the placement of the graph. Thus, it is concluded that the algorithmization of the graph placement problem requires an approach based on heuristic or stochastic methods. To prove the NP-completeness of the graph placement problem, we use the well-known NP-complete Hamiltonian cycle search problem. It is shown that the graph placement problem is a generalization over the Hamiltonian cycle problem. Also the problem of the placement of the graph as the optimization and presents some auxiliary results, which are set nalivayut the connection between the two problems: NP-complete optimization problem and embed the graph.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
