138 search results - page 1 / 28 » Bisimplicial Edges in Bipartite Graphs |
COLOGNETWENTE
2010
13 years 3 months ago
2010
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...
ECCC
2010
12 years 12 months ago
2010
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
COCOON
2010
Springer
13 years 9 months ago
2010
Springer
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
COCOON
2009
Springer
13 years 11 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...