Faenza, Y., Oriolo, G., Stauffer, G. (2011). An algorithmic decomposition of claw-free graphs leading to an O(n^3)-algorithm for the weighted stable set problem.. In Proceedings of the Twenty-second annual ACM-SIAM Symposium on discrete algorithms: SODA 2011, San Francisco, California, USA, January 23-25 / edited by Dana Randall (pp.630-646). SIAM.
An algorithmic decomposition of claw-free graphs leading to an O(n^3)-algorithm for the weighted stable set problem.
ORIOLO, GIANPAOLO;
2011-01-01
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.