Distributed Detection of Cycles
暂无分享,去创建一个
[1] Shay Kutten,et al. Proof labeling schemes , 2005, PODC '05.
[2] Pierre Fraigniaud,et al. Survey of Distributed Decision , 2016, Bull. EATCS.
[3] Dana Ron,et al. Finding cycles and trees in sublinear time , 2010, Random Struct. Algorithms.
[4] Eldar Fischer,et al. Fast Distributed Algorithms for Testing Graph Properties , 2016, DISC.
[5] Azzedine Boukerche,et al. A Distributed Graph Algorithm for the Detection of Local Cycles and Knots , 1998, IEEE Trans. Parallel Distributed Syst..
[6] Noga Alon,et al. A characterization of easily testable induced subgraphs , 2004, SODA '04.
[7] M. Kaufmann. What Can Be Computed Locally ? , 2003 .
[8] Roger Wattenhofer,et al. Anonymous networks: randomization = 2-hop coloring , 2014, PODC.
[9] Raghu Meka,et al. Anti-concentration for Polynomials of Independent Random Variables , 2016, Theory Comput..
[10] Boaz Patt-Shamir,et al. Distributed discovery of large near-cliques , 2011, Distributed Computing.
[11] Pierre Fraigniaud,et al. Towards a complexity theory for local distributed computing , 2013, JACM.
[12] Dana Ron,et al. Property Testing in Bounded Degree Graphs , 2002, STOC '97.
[13] David Conlon,et al. Graph removal lemmas , 2012, Surveys in Combinatorics.
[14] Vojtech Rödl,et al. The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..
[15] Luca Trevisan,et al. Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..
[16] Pierre Fraigniaud,et al. A hierarchy of local decision , 2016, ICALP.
[17] A. Rényii,et al. ON A PROBLEM OF GRAPH THEORY , 1966 .
[18] B. Monien. How to Find Long Paths Efficiently , 1985 .
[19] Pranay Chaudhuri. A Self-Stabilizing Algorithm for Detecting Fundamental Cycles in a Graph , 1999, J. Comput. Syst. Sci..
[20] Oded Goldreich,et al. Property Testing - Current Research and Surveys , 2010, Property Testing.
[21] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[22] Pierre Fraigniaud,et al. What Can Be Verified Locally? , 2017, STACS.
[23] Pranay Chaudhuri. An optimal distributed algorithm for finding a set of fundamental cycles in a graph , 2002, Comput. Syst. Sci. Eng..
[24] Shyamoli Chaudhuri. The power of worldsheets: Applications and prospects , 2002 .
[25] Mika Göös,et al. Locally Checkable Proofs in Distributed Computing , 2016, Theory Comput..
[26] M. Lucertini,et al. Analysis and design of algorithms for combinatorial problems , 1985 .
[27] Pierre Fraigniaud,et al. Randomized distributed decision , 2012, Distributed Computing.
[28] Noga Alon,et al. Testing triangle-freeness in general graphs , 2006, SODA '06.
[29] Noga Alon,et al. Efficient Testing of Large Graphs , 2000, Comb..
[30] Christoforos N. Hadjicostis,et al. Distributed Cycle Detection and Removal , 2018, IEEE Transactions on Control of Network Systems.
[31] Ivan Rapaport,et al. Distributed Testing of Excluded Subgraphs , 2016, DISC.
[32] Pierre Fraigniaud,et al. Randomized Local Network Computing , 2015, SPAA.