Bisimplicial edges in bipartite graphs

Authors:
Matthijs Bomhoff;Bodo Manthey
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 4
Cited 0

Matching is as easy as matrix inversion

Combinatorica
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Randomized algorithms

Randomized algorithms
Recognizing quasi-triangulated graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

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 find such edges in bipartite graphs. Our algorithm is very simple and easy to implement. Its running-time is O(nm), where n is the number of vertices and m is the number of edges. Furthermore, for any fixed p and random bipartite graphs in the G"n","n","p model, the expected running-time of our algorithm is O(n^2), which is linear in the input size.