Discovering bipartite substructure in directed networks

DOI10.1112/S1461157009000072zbMath1223.68087MaRDI QIDQ3092475

Desmond J. Higham, Alan M. Taylor, J. Keith Vass

Publication date: 16 September 2011

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) General biology and biomathematics (92B05)

Related Items (5)

COUPLED NETWORK APPROACH TO PREDICTABILITY OF FINANCIAL MARKET RETURNS AND NEWS SENTIMENTS ⋮ On the sign patterns of the smallest signless Laplacian eigenvector ⋮ A spectral method for bipartizing a network and detecting a large anti-community ⋮ A modularity based spectral method for simultaneous community and anti-community detection ⋮ Non-Backtracking Alternating Walks

Uses Software

• JOSTLE
• MC73

This page was built for publication: Discovering bipartite substructure in directed networks