Spectral partitioning of random graphs with given expected degrees
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) problems. The theory of large networks emerging recently provides convincing evide...
Guardado en:
| Autores principales: | Goerdt, Andreas, Coja-Oghlan, Amin, Lanka, André |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2006
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/24421 |
| Aporte de: |
Ejemplares similares
-
Degree-greedy algorithms on large random graphs
por: Bermolen, P., et al. -
Degree-greedy algorithms on large random graphs
Publicado: (2019) -
The jamming constant of uniform random graphs
por: Bermolen, P., et al. -
The jamming constant of uniform random graphs
Publicado: (2017) -
Graph partitioning
Publicado: (2011)