Bisimplicial Edges in Bipartite Graphs

Bisimplicial edges in bipartite graphs are closely related to pivots in Gaussian elimination that avoid turning zeroes into non-zeroes. We present a new deterministic algorithm to find such edges in bipartite graphs. The expected time complexity of our new algorithm is O n2 log n on random bipartite graphs in which each edge is present with a fixed probability p, a polynomial improvement over the fastest algorithm found in the existing literature. Key words: bipartite graphs, random graphs, algorithms, Gaussian elimination

• Type: Journal
• Year: 2010
• Where: COLOGNETWENTE
• Authors: Matthijs Bomhoff, Bodo Manthey
• Keywords: Algorithms, Bipartite Graphs, COLOGNETWENTE 2010, Gaussian Elimination, Optimization