Sciweavers

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

8

FOCS
1999
IEEE

favoriteEmaildiscussreport

84views Theoretical Computer Science» more FOCS 1999»

Efficient Testing of Large Graphs

13 years 8 months ago

Efficient Testing of Large Graphs

Download www.cs.tau.ac.il

Noga Alon, Eldar Fischer, Michael Krivelevich, Mar

Real-time Traffic

FOCS 1999 | Theoretical Computer Science |

claim paper

Related Content

» Taming verification hardness an efficient algorithm for testing subgraph isomorphism

» Efficient Coloring of a Large Spectrum of Graphs

» A novel approach for efficient supergraph query processing on graph databases

» CLAN An Algorithm for Mining Closed Cliques from Large Dense Graph Databases

» Fast Katz and Commuters Efficient Estimation of Social Relatedness in Large Networks

» Efficient GraphBased SemiSupervised Learning of Structured Tagging Models

» Every MinorClosed Property of Sparse Graphs is Testable

» Domain Adaptive Semantic Diffusion for Large Scale ContextBased Video Annotation

» Improving coverage analysis and test generation for large designs

Post Info
More Details (n/a)

Added	03 Aug 2010
Updated	03 Aug 2010
Type	Conference
Year	1999
Where	FOCS
Authors	Noga Alon, Eldar Fischer, Michael Krivelevich, Mario Szegedy

Comments (0)