Spectral partitioning of random graphs with given expected degrees
Text / resource
Text / resource
It is a well established fact, that - in the case of classical random graphs like (variants of) Gn,p or random regular graphs - spectral methods yield efficient algorithms for clustering (e. g. colouring or bisection) pr...
Idioma English
El enlace apunta a material asociado, anexos, tablas, datos o página complementaria. No se marca como libro/texto completo.
Material complementario