Abstract: We present a linear-time algorithm for deciding first-order logic (FOL) properties in classes of graphs with bounded expansion. Many natural classes of graphs have bounded expansion: graphs ...

Abstract: In this article, we study robust consensus problems for continuous-time first-order multiagent systems (MASs ... With an undirected graph, we show that the DCM can be determined exactly by ...