Abstract
This paper considers families of combinatorial polytopes for which the problem of recognizing the nonadjacency of two arbitrary vertices is NPcom� plete. It is shown that all such polytopes contain spe� cial 0/1�programming problems as faces, for which the problem of recognizing the nonadjacency of verti� ces is NPcomplete too.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
