Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure

DOI10.1007/978-3-642-45030-3_61zbMath1406.68086arXiv1209.5045OpenAlexW1849808149MaRDI QIDQ2872130

Pan Peng, Ang Sheng Li

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (1)

Bipartite communities via spectral partitioning

Uses Software

• IsoRankN

This page was built for publication: Detecting and Characterizing Small Dense Bipartite-Like Subgraphs by the Bipartiteness Ratio Measure