Abstract
This paper gives a decomposition theory for bipartite graphs. It uses bimodules, a special case of 2-modules (also known as homogeneous pairs, an extension of both modules and splits). It is shown how a unique decomposition tree represents the bimodular decomposition of a bipartite graph, with strong analogs with modular decomposition of graphs. An O(mn3) algorithm for this decomposition is provided. At least a classification of the 2-modules of a bipartite graph is given. © Springer-Verlag 2004.
Cite
CITATION STYLE
Fouquet, J. L., Habib, M., De Montgolfier, F., & Vanherpe, J. M. (2004). Bimodular decomposition of bipartite graphs. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3353, 117–128. https://doi.org/10.1007/978-3-540-30559-0_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
