Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques

DOI10.1007/978-3-030-03599-0zbMath1409.05001MaRDI QIDQ1755625

Lijun Chang, Lu Qin

Publication date: 10 January 2019

Published in: Springer Series in the Data Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-03599-0

zbMATH Keywords

graph analysis; dense subgraphs

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68P05: Data structures

68W25: Approximation algorithms

05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics

05C42: Density (toughness, etc.)

Related Items

An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem