|Title:||Some NP-complete problems on graphs
|Abstract:||A paper published in a 1977 Conference and very difficult to find.
In this paper we add a number of new graph problems to the long list of the known NP-complete problems. Among them are the Optimal linear cut arrangement, Optimal directed tree arrangement and arrangements on a grid.
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2011/CS/CS-2011-05), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 2011
To the main CS technical reports page
Computer science department, Technion