Year: 2025
Type: conference-paper
Abstract: We establish that for every first-order logic (FO) formula ϕ, which captures a vast number of computational problems on graphs, and every graph class G of bounded expansion, there exists a deterministic distributed algorithm that, for any n-node graph G ∈ G with diameter D, determines whether G ⊨ ϕ within O(D+log n) rounds in the standard CONGEST model. Graph classes of bounded expansion encompass many well-known families of sparse graphs, including planar graphs, bounded-genus graphs, bounded-treedepth graphs, bounded-treewidth graphs, bounded-degree graphs, graphs that exclude a fixed graph H as a minor or topological minor, random graphs with constant average degree (a.a.s.), and many network models (e.g., stochastic block models) for some ranges of parameters.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Awards: Quantum algorithms for massive data, Distributed Network Computing through the Lens of Combinatorial Topology, G4003710626, G4656594441, COMPACT DISTRIBUTED CERTIFICATION OF HEREDITARY GRAPH CLASSES, G5399623649, CENTER FOR MATHEMATICAL MODELING (CMM), COMPUTING POWER OF HYBRID MODELS IN SYNCHRONOUS NETWORKS
OpenAlex ID: W4411278177