1 paper
Weizhi Lu, Kidiyo Kpalma, Joseph Ronsin
This paper proposes an efficient method to construct the bipartite graph with as many edges as possible while without introducing the shortest cycles of length equal to 4. The bina…