Erd˝os-R´enyi and Preferential Attachment Graph Models: Local Computation Algorithms for Spanners

Average-Case LCAs provide efficient access to sparse connected subgraphs with superior size-stretch trade-offs in Erd˝os-R´enyi graphs.