Sciweavers

Share
COLOGNETWENTE
2010

Bisimplicial Edges in Bipartite Graphs

8 years 4 months ago
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
Matthijs Bomhoff, Bodo Manthey
Added 24 Jan 2011
Updated 24 Jan 2011
Type Journal
Year 2010
Where COLOGNETWENTE
Authors Matthijs Bomhoff, Bodo Manthey
Comments (0)
books