Cargando…
Cohesive subgraph computation over large sparse graphs: algorithms, data structures, and programming techniques
This book is considered the first extended survey on algorithms and techniques for efficient cohesive subgraph computation. With rapid development of information technology, huge volumes of graph data are accumulated. An availability of rich graph data not only brings great opportunities for realizi...
Autores principales: | Chang, Lijun, Qin, Lu |
---|---|
Lenguaje: | eng |
Publicado: |
Springer
2018
|
Materias: | |
Acceso en línea: | https://dx.doi.org/10.1007/978-3-030-03599-0 http://cds.cern.ch/record/2653131 |
Ejemplares similares
-
Faster algorithms for counting subgraphs in sparse graphs
por: Bressan, Marco
Publicado: (2021) -
Graph theory and sparse matrix computation
por: George, Alan, et al.
Publicado: (1993) -
Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs
por: Novotná, Jana, et al.
Publicado: (2020) -
On algorithms for permuting large entries to the diagonal of a sparse matrix
por: Duff, I S, et al.
Publicado: (1999) -
Computer solution of large sparse positive definite systems
por: George, Alan, et al.
Publicado: (1981)