A combinatorial algorithm for computing a maximum independent set in a $t$-perfect graph


Published in:
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), 517-522
Year:
2003
Publisher:
ACM
Laboratories:




 Record created 2008-05-13, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)