A Centralized Local Algorithm for the Sparse Spanning Graph Problem
暂无分享,去创建一个
[1] Dana Ron,et al. Deterministic Stateless Centralized Local Algorithms for Bounded Degree Graphs , 2014, ESA.
[2] Alejandro A. Schäffer,et al. Graph spanners , 1989, J. Graph Theory.
[3] Massachusetts Instmite. Local Computation Algorithms for Graphs of Non-Constant Degrees , 2014 .
[4] Uriel Feige,et al. Learning and inference in the presence of corrupted inputs , 2015, COLT.
[5] Ronitt Rubinfeld,et al. Fast Local Computation Algorithms , 2011, ICS.
[6] Dana Ron,et al. A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor , 2013, ICALP.
[7] Reut Levi,et al. On Testing Minor-Freeness in Bounded Degree Graphs With One-Sided Error , 2017, ArXiv.
[8] Ronitt Rubinfeld,et al. Constructing near spanning trees with few local inspections , 2015, Random Struct. Algorithms.
[9] Michael Elkin,et al. Efficient Algorithms for Constructing Very Sparse Spanners and Emulators , 2016, SODA.
[10] Noga Alon,et al. Space-efficient local computation algorithms , 2011, SODA.
[11] Dana Ron,et al. Finding cycles and trees in sublinear time , 2010, Random Struct. Algorithms.
[12] Ronitt Rubinfeld,et al. Local Algorithms for Sparse Spanning Graphs , 2014, Algorithmica.
[13] Yishay Mansour,et al. Converting Online Algorithms to Local Computation Algorithms , 2012, ICALP.
[14] Ronitt Rubinfeld. Can We Locally Compute Sparse Connected Subgraphs? , 2017, CSR.