暂无分享,去创建一个
[1] Dana Ron,et al. Property testing and its connection to learning and approximation , 1998, JACM.
[2] Noga Alon,et al. Testing subgraphs in directed graphs , 2004, J. Comput. Syst. Sci..
[3] Asaf Shapira,et al. A sparse regular approximation lemma , 2019, Transactions of the American Mathematical Society.
[4] Oded Goldreich,et al. Introduction to Property Testing , 2017 .
[5] Peter Buneman,et al. A characterisation of rigid circuit graphs , 1974, Discret. Math..
[6] Takuya Kon-no,et al. Transactions of the American Mathematical Society , 1996 .
[7] Asaf Shapira,et al. Efficient Testing without Efficient Regularity , 2018, ITCS.
[8] Lance Fortnow,et al. Tolerant Versus Intolerant Testing for Boolean Properties , 2005, Computational Complexity Conference.
[9] Noga Alon,et al. Testing of bipartite graph properties ∗ , 2005 .
[10] B. Peyton,et al. An Introduction to Chordal Graphs and Clique Trees , 1993 .
[11] Kenji Obata,et al. A lower bound for testing 3-colorability in bounded-degree graphs , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[12] Tolerant Junta Testing and the Connection to Submodular Optimization and Function Isomorphism , 2019, ACM Trans. Comput. Theory.
[13] Martin S. Andersen,et al. Chordal Graphs and Semidefinite Optimization , 2015, Found. Trends Optim..
[14] Piotr Berman,et al. Tolerant Testers of Image Properties , 2016, ICALP.
[15] Dana Ron,et al. Approximating the distance to monotonicity in high dimensions , 2010, TALG.
[16] F. Gavril. The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .
[17] Luca Trevisan,et al. Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..
[18] Noga Alon. Testing subgraphs in large graphs , 2002, Random Struct. Algorithms.
[19] Dana Ron,et al. Approximating the distance to properties in bounded-degree and general sparse graphs , 2009, TALG.
[20] Bernard Chazelle,et al. Approximating the Minimum Spanning Tree Weight in Sublinear Time , 2001, ICALP.
[21] Shubhangi Saraf,et al. Tolerant Linearity Testing and Locally Testable Codes , 2009, APPROX-RANDOM.
[22] E. Szemerédi. Regular Partitions of Graphs , 1975 .
[23] Alan M. Frieze,et al. Quick Approximation to Matrices and Applications , 1999, Comb..
[24] V. Sós,et al. Convergent Sequences of Dense Graphs I: Subgraph Frequencies, Metric Properties and Testing , 2007, math/0702004.
[25] M. Varacallo,et al. 2019 , 2019, Journal of Surgical Orthopaedic Advances.
[26] Ronitt Rubinfeld,et al. Local Reconstructors and Tolerant Testers for Connectivity and Diameter , 2012, APPROX-RANDOM.
[27] Katrin Baumgartner. Graph Theory And Sparse Matrix Computation , 2016 .
[28] Oded Goldreich,et al. Contemplations on Testing Graph Properties , 2005, Sublinear Algorithms.
[29] Yoshiharu Kohayakawa,et al. Estimating the distance to a hereditary graph property , 2017, Electron. Notes Discret. Math..
[30] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, Comb..
[31] Noga Alon,et al. Testing satisfiability , 2002, SODA '02.
[32] Eldar Fischer,et al. Testing versus Estimation of Graph Properties , 2007, SIAM J. Comput..
[33] Noga Alon,et al. A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.
[34] Venkatesan Guruswami,et al. Tolerant Locally Testable Codes , 2005, APPROX-RANDOM.
[35] Ronitt Rubinfeld,et al. A sublinear algorithm for weakly approximating edit distance , 2003, STOC '03.
[36] Derek G. Corneil,et al. Complement reducible graphs , 1981, Discret. Appl. Math..
[37] Noga Alon,et al. Testing k-colorability , 2002, SIAM J. Discret. Math..
[38] László Lovász,et al. Graph limits and parameter testing , 2006, STOC '06.
[39] Yukio Shibata,et al. On the tree representation of chordal graphs , 1988, J. Graph Theory.
[40] David Conlon,et al. Bounds for graph regularity and removal lemmas , 2011, ArXiv.
[41] Lars Engebretsen,et al. Property testers for dense constraint satisfaction programs on finite domains , 2002, Random Struct. Algorithms.
[42] Jacob Fox,et al. A new proof of the graph removal lemma , 2010, ArXiv.
[43] Michel Habib,et al. Reduced clique graphs of chordal graphs , 2012, Eur. J. Comb..
[44] Madhu Sudan,et al. Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..
[45] Ronitt Rubinfeld,et al. Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..
[46] Ronitt Rubinfeld,et al. Testing Closeness of Discrete Distributions , 2010, JACM.
[47] Noga Alon,et al. Additive approximation for edge-deletion problems , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[48] Asaf Shapira,et al. Removal lemmas with polynomial bounds , 2016, STOC.
[49] Noga Alon,et al. Easily Testable Graph Properties , 2015, Combinatorics, Probability and Computing.
[50] Asaf Shapira,et al. Approximate Hypergraph Partitioning and Applications , 2010, SIAM J. Comput..
[51] Noga Alon,et al. A characterization of easily testable induced subgraphs , 2004, SODA '04.
[52] Dana Ron,et al. On the Testability of Graph Partition Properties , 2018, APPROX-RANDOM.
[53] Vojtech Rödl,et al. The algorithmic aspects of the regularity lemma , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[54] D. Seinsche. On a property of the class of n-colorable graphs , 1974 .
[55] W. T. Gowers,et al. Lower bounds of tower type for Szemerédi's uniformity lemma , 1997 .
[56] Alexander Kmentt. 2017 , 2018, The Treaty Prohibiting Nuclear Weapons.
[57] Bernard Chazelle,et al. Estimating the distance to a monotone function , 2007, Random Struct. Algorithms.
[58] Dana Ron,et al. Distance Approximation in Bounded-Degree and General Sparse Graphs , 2006, APPROX-RANDOM.
[59] Yoshiharu Kohayakawa,et al. Estimating parameters associated with monotone properties , 2017, Combinatorics, Probability and Computing.