Sciweavers

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

98

ICDM
2007
IEEE

127views Data Mining» more ICDM 2007»

Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees

15 years 9 months ago

Efficient Algorithms for Mining Significant Substructures in Graphs with Quality Guarantees

Download www.cs.ucsb.edu

Huahai He, Ambuj K. Singh

Real-time Traffic

Data Mining | ICDM 2007 |

claim paper

Related Content

» An Efficient and Accurate GraphBased Approach to Detect Population Substructure

» Clustering Large Attributed Graphs An Efficient Incremental Approach

» ObstacleAvoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs

» Incremental Maintenance of XML Structural Indexes

Post Info
More Details (n/a)

Added	03 Jun 2010
Updated	03 Jun 2010
Type	Conference
Year	2007
Where	ICDM
Authors	Huahai He, Ambuj K. Singh

Comments (0)