|
This article is cited in 1 scientific paper (total in 1 paper)
Computation of the biclique partition number for graphs with specific blocks
V. V. Lepin, O. I. Duginov Institute of Mathematics of the National Academy of Sciences of Belarus
Abstract:
The biclique partition number of an undirected graph $G=(V,E)$ is the smallest number of bicliques (complete
bipartite subgraphs) of the graph $G$ needed to partition the edge set $E.$ We present an efficient algorithm
for finding the biclique partition number of a connected graph whose blocks are either complete graphs or
complete bipartite graphs or cycles.
Received: 30.12.2011
Citation:
V. V. Lepin, O. I. Duginov, “Computation of the biclique partition number for graphs with specific blocks”, Tr. Inst. Mat., 20:1 (2012), 60–73
Linking options:
https://www.mathnet.ru/eng/timb163 https://www.mathnet.ru/eng/timb/v20/i1/p60
|
|