Bipartite structure of all complex networks

From MaRDI portal
Publication:2390254

DOI10.1016/j.ipl.2004.03.007zbMath1178.68031OpenAlexW1982442837MaRDI QIDQ2390254

Jean-Loup Guillaume, Matthieu Latapy

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.03.007




Related Items (24)

Networks beyond pairwise interactions: structure and dynamicsClustering Coefficient of a Preferred Attachment Affiliation NetworkEfficiently covering complex networks with cliques of similar verticesA general evolving model for growing bipartite networksKnown Algorithms for Edge Clique Cover are Probably OptimalExplosive synchronization in bipartite networksRandom Intersection Graph ProcessClique Cover and Graph SeparationPhase transition in random intersection graphs with communitiesDegree distributions of evolving alphabetic bipartite networks and their projectionsDegree and clustering coefficient in sparse random intersection graphsOn the kernel size of clique cover reductions for random intersection graphsRejection sampling of bipartite graphs with given degree sequenceOn the termination of some biclique operators on multipartite graphsOn the optimization of multitasking process with multiplayerEmpirical Analysis of the Architecture of the Interbank Market and Credit Market Using Network TheoryTermination of the iterated strong-factor operator on multipartite graphsLarge-scale clique cover of real-world networksPreferred attachment in affiliation networksA scale-free graph model based on bipartite graphsExploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory ApplicationsEigenvector-based identification of bipartite subgraphsIsoperimetric numbers of randomly perturbed intersection graphsRandom intersection graphs with communities



Cites Work


This page was built for publication: Bipartite structure of all complex networks