conference paper
A combinatorial algorithm for computing a maximum independent set in a $t$-perfect graph
2003
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003)
Type
conference paper
Author(s)
Date Issued
2003
Publisher
Published in
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003)
Start page
517
End page
522
Written at
OTHER
EPFL units
Available on Infoscience
May 13, 2008
Use this identifier to reference this record