Sciweavers

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

44

IPL
2010

favoriteEmaildiscussreport

158views more IPL 2010»

Finding bipartite subgraphs efficiently

13 years 8 months ago

Finding bipartite subgraphs efficiently

Download www.math.uic.edu

Polynomial algorithms are given for the following two problems:

Dhruv Mubayi, György Turán

Real-time Traffic

Balanced Bipartite Graphs | Balanced Bipartite Subgraph | Complete Balanced Bipartite | Image Processing | IPL 2010 |

claim paper

Related Content

» On the minimal degree implying equality of the largest trianglefree and bipartite subgraph...

» Efficient algorithms for finding critical subgraphs

» Efficient Mining of Large Maximal Bicliques

» Polar cographs

» A new characterization of P6free graphs

» Structural Analysis for DifferentialAlgebraic Systems Complexity Formulation and Facets

» Efficient Discovery of Frequent Correlated Subgraph Pairs

» ClosureTree An Index Structure for Graph Queries

» Finding Frequent Patterns in a Large Sparse Graph

Post Info
More Details (n/a)

Added	05 Mar 2011
Updated	05 Mar 2011
Type	Journal
Year	2010
Where	IPL
Authors	Dhruv Mubayi, György Turán

Comments (0)