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

ACM-SIAM Symposium on discrete algorithms
San Francisco
2011
Society for industrial and applied mathematics
Rilevanza internazionale
2011
Settore MAT/09 - RICERCA OPERATIVA
English
http://www.siam.org/proceedings/soda/2011/SODA11_049_faenzay.pdf
Intervento a convegno
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.
Faenza, Y; Oriolo, G; Stauffer, G
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/12069
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact