Bisimplicial edges in bipartite graphs

Share/Save/Bookmark

Bomhoff, Matthijs and Manthey, Bodo (2010) Bisimplicial edges in bipartite graphs. In: Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2010, 25-27 May 2010, Cologne, Germany (pp. pp. 29-32).

open access
[img]
Preview
PDF
128kB
Abstract: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 nd such edges in bipartite graphs. The expected time complexity of our new algorithm is $O(n^2 \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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/75056
Conference URL:http://ctw.uni-koeln.de/
Proceedings URL:http://ctw.uni-koeln.de/CTW2010.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page