Finding lasting dense subgraphs

DOI10.1007/s10618-018-0602-xzbMath1458.68145arXiv1612.05440OpenAlexW3101796089WikidataQ110612331 ScholiaQ110612331MaRDI QIDQ2218373

Konstantinos Semertzidis, Panayiotis Tsaparas, Evaggelia Pitoura, Evimaria Terzi

Publication date: 15 January 2021

Published in: Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.05440

zbMATH Keywords

social networksdense subgraphsgraph history

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Density (toughness, etc.) (05C42)

Related Items (3)

Generalized core maintenance of dynamic bipartite graphs ⋮ Finding dense subgraphs with maximum weighted triangle density ⋮ Graph signatures: identification and optimization

Cites Work

• Combinatorial algorithms for the maximum \(k\)-plex problem
• An exact algorithm for the maximum \(k\)-club problem in an undirected graph
• Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams
• On Finding Dense Subgraphs
• Greedily Finding a Dense Subgraph
• Algorithm Theory - SWAT 2004
• Unnamed Item

This page was built for publication: Finding lasting dense subgraphs