Greedily finding a dense subgraph

DOI10.1007/3-540-61422-2_127zbMath1502.68201OpenAlexW1660722709MaRDI QIDQ5054810

Yuichi Asahiro, Takeshi Tokuyama, Hisao Tamaki, Kazuo Iwama

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_127

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22) Density (toughness, etc.) (05C42)

Related Items (3)

Approximation algorithms for maximum dispersion ⋮ Extracting brain disease‐related connectome subgraphs by adaptive dense subgraph discovery ⋮ Computing the \(k\) densest subgraphs of a graph

Cites Work

• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Generating sparse 2—spanners
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedily finding a dense subgraph