Sciweavers

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

20

SIGMOD
2010
ACM

favoriteEmaildiscussreport

172views Database» more SIGMOD 2010»

Finding maximum degrees in hidden bipartite graphs

14 years 3 months ago

Finding maximum degrees in hidden bipartite graphs

Download www.cse.cuhk.edu.hk

Yufei Tao, Cheng Sheng, Jianzhong Li

Real-time Traffic

Database | SIGMOD 2010 |

claim paper

Related Content

» Acyclic improper colourings of graphs with bounded maximum degree

» Finding Maximum Edge Bicliques in Convex Bipartite Graphs

» Edge Coloring and Decompositions of Weighted Graphs

» The path partition problem and related problems in bipartite graphs

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

» An adjustable linear time parallel algorithm for maximum weight bipartite matching

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

» Maximum Bipartite Matching Size And Application to Cuckoo Hashing

» Visual Analysis Tool for Bipartite Networks

Post Info
More Details (n/a)

Added	18 Jul 2010
Updated	18 Jul 2010
Type	Conference
Year	2010
Where	SIGMOD
Authors	Yufei Tao, Cheng Sheng, Jianzhong Li

Comments (0)