Local Graph Partitions for Approximation and Testing
暂无分享,去创建一个
[1] I. Benjamini,et al. Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..
[2] G. Elek. Parameter testing in bounded degree graphs of subexponential growth , 2010 .
[3] Dana Ron,et al. Approximating the distance to properties in bounded-degree and general sparse graphs , 2009, TALG.
[4] David S. Johnson,et al. The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.
[5] Krzysztof Onak,et al. Constant-Time Approximation Algorithms via Local Improvements , 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[6] Dana Ron,et al. On Approximating the Minimum Vertex Cover in Sublinear Time and the Connection to Distributed Algorithms , 2007, Electron. Colloquium Comput. Complex..
[7] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[8] Oded Schramm,et al. Every minor-closed property of sparse graphs is testable , 2008, Electron. Colloquium Comput. Complex..
[9] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[10] Robin Thomas,et al. A separator theorem for graphs with an excluded minor and its applications , 1990, STOC '90.
[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] David Zuckerman,et al. On Unapproximable Versions of NP-Complete Problems , 1996, SIAM J. Comput..
[13] Neil Robertson,et al. Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.
[14] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[15] Christoph Lenzen,et al. What can be approximated locally?: case study: dominating sets in planar graphs , 2008, SPAA '08.
[16] Gábor Elek,et al. Parameter testing in bounded degree graphs of subexponential growth , 2007, Random Struct. Algorithms.
[17] Ronitt Rubinfeld,et al. Tolerant property testing and distance approximation , 2006, J. Comput. Syst. Sci..
[18] Noga Alon,et al. A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[19] Artur Czumaj,et al. Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs , 2009, SIAM J. Comput..
[20] Yuval Peres,et al. Finding sparse cuts locally using evolving sets , 2008, STOC '09.
[21] Gabor Elek,et al. L2-spectral invariants and convergent sequences of finite graphs , 2007, 0709.1261.
[22] Paul D. Seymour,et al. Graph Minors. XX. Wagner's conjecture , 2004, J. Comb. Theory B.
[23] Yuichi Yoshida,et al. An improved constant-time approximation algorithm for maximum~matchings , 2009, STOC '09.
[24] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.
[25] R. Tarjan,et al. A Separator Theorem for Planar Graphs , 1977 .