Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > DETAIL:

Paper:

TR08-010 | 17th January 2008 00:00

Every Minor-Closed Property of Sparse Graphs is Testable

TR08-010
Authors: Itai Benjamini, Oded Schramm, Asaf Shapira
Publication: 25th February 2008 10:33