Infoscience

Conference paper

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

    Reference

    • DISOPT-CONF-2003-001

    Record created on 2008-05-13, modified on 2016-08-08

Fulltext

  • There is no available fulltext. Please contact the lab or the authors.

Related material