Abstract
Abstract We present an algorithm for computing both upper and lower bounds on the Chvatal-rank of antiwebs, starting from the edge constraint stable set polytope. With the help of this algorithm we have been able to compute the exact values of the Chvatal-rank for all antiwebs containing up to 5,000 nodes. Moreover, the algorithm can be easily adapted to start from the clique constraint stable set polytope.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
