| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652728 | Electronic Notes in Discrete Mathematics | 2010 | 8 Pages |
Abstract
We present an algorithm for computing both upper and lower bounds on the Chvátal-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 Chvátal-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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
