A Local Algorithm for Finding Dense Bipartite-Like Subgraphs
From MaRDI portal
Publication:2914319
DOI10.1007/978-3-642-32241-9_13zbMath1364.68311OpenAlexW132592266MaRDI QIDQ2914319
Publication date: 25 September 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32241-9_13
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Internet topics (68M11)
This page was built for publication: A Local Algorithm for Finding Dense Bipartite-Like Subgraphs