Bipartite structure of all complex networks

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

zbMATH Keywords

modellinggraphsbipartite graphsinterconnection networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (24)

Networks beyond pairwise interactions: structure and dynamics ⋮ Clustering Coefficient of a Preferred Attachment Affiliation Network ⋮ Efficiently covering complex networks with cliques of similar vertices ⋮ A general evolving model for growing bipartite networks ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ Explosive synchronization in bipartite networks ⋮ Random Intersection Graph Process ⋮ Clique Cover and Graph Separation ⋮ Phase transition in random intersection graphs with communities ⋮ Degree distributions of evolving alphabetic bipartite networks and their projections ⋮ Degree and clustering coefficient in sparse random intersection graphs ⋮ On the kernel size of clique cover reductions for random intersection graphs ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ On the termination of some biclique operators on multipartite graphs ⋮ On the optimization of multitasking process with multiplayer ⋮ Empirical Analysis of the Architecture of the Interbank Market and Credit Market Using Network Theory ⋮ Termination of the iterated strong-factor operator on multipartite graphs ⋮ Large-scale clique cover of real-world networks ⋮ Preferred attachment in affiliation networks ⋮ A scale-free graph model based on bipartite graphs ⋮ Exploiting The Structure of Bipartite Graphs for Algebraic and Spectral Graph Theory Applications ⋮ Eigenvector-based identification of bipartite subgraphs ⋮ Isoperimetric numbers of randomly perturbed intersection graphs ⋮ Random intersection graphs with communities

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure and function of networks
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• Random graph models of social networks
• A critical point for random graphs with a given degree sequence
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks

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