A local algorithm for finding dense bipartite-like subgraphs

DOI10.1007/978-3-642-32241-9_13MaRDI QIDQ2914319zbMATH OpenOpenAlexFDO

Authors Pan Peng

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

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• A local algorithm for finding dense subgraphs
• Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
• On Finding Dense Subgraphs
• Finding Dense Subgraphs with Size Bounds
• Algorithms and Computation

Cited in

(2)

• Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure
• A local algorithm for finding dense subgraphs

This page was built for publication: A local algorithm for finding dense bipartite-like subgraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914319)