Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

126

Voted

COCOON
2010
Springer

179views Combinatorics» more COCOON 2010»

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

15 years 10 months ago

Finding Maximum Edge Bicliques in Convex Bipartite Graphs

Download cg.scs.carleton.ca

Doron Nussbaum, Shuye Pu, Jörg-Rüdiger S

Real-time Traffic

COCOON 2010 | Combinatorics |

claim paper

Related Content

» On Finding Large Conjunctive Clusters

» A Branchandprice Approach to the kClustering Minimum Biclique Completion Problem

» Bipartite Ramsey numbers and Zarankiewicz numbers

» Nonnegative Matrix Factorization for Combinatorial Optimization Spectral Clustering Graph ...

» Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted ...

» Edge Coloring and Decompositions of Weighted Graphs

» Acyclic and Frugal Colourings of Graphs

Post Info
More Details (n/a)

Added	19 Jul 2010
Updated	19 Jul 2010
Type	Conference
Year	2010
Where	COCOON
Authors	Doron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh

Comments (0)