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

DOI10.1007/978-3-030-03599-0zbMath1409.05001OpenAlexW4251396722MaRDI 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 analysisdense subgraphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Approximation algorithms (68W25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Density (toughness, etc.) (05C42)

Related Items (1)

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

This page was built for publication: Cohesive subgraph computation over large sparse graphs. Algorithms, data structures, and programming techniques