13.07.2015 Views

Teoría de Grafos

Teoría de Grafos

Teoría de Grafos

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Un k-core <strong>de</strong> un grafo G es un subgrafo G’ tal que elgrado <strong>de</strong> cada nodo <strong>de</strong> G’ es al menos k. Este algoritmo produce una jerarquía <strong>de</strong> subgrafosbasandose en el k <strong>de</strong> los k-cores obtenidos paracada posible k.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!