Local Algorithms for Two Problems on Locally Tree-Like Graphs
summary
Presents local algorithms for two computational problems on graphs that are locally tree-like, focusing on methods that use only neighbourhood information rather than global computation. Discusses performance and behavior of these local algorithms in the context of graphs that locally resemble trees, relating to approximate counting and Markov-chain/phase-transition phenomena.
AI-written summary · about