A combinatorial algorithm for computing a maximum independent set in a $t$-perfect graph
2003
Details
Title
A combinatorial algorithm for computing a maximum independent set in a $t$-perfect graph
Author(s)
Eisenbrand, Friedrich ; Funke, Stefan ; Garg, Naveen ; Könemann, Jochen
Published in
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003)
Pages
517-522
Date
2003
Publisher
ACM
Laboratories
DISOPT
Record Appears in
Scientific production and competences > SB - School of Basic Sciences > MATH - Institute of Mathematics > DISOPT - Chair of Discrete Optimization
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Work outside EPFL
Conference Papers
Published
Scientific production and competences > SB - School of Basic Sciences > Mathematics
Work outside EPFL
Conference Papers
Published
Record creation date
2008-05-13