For a system of tasks that may lock resources, the “wait-for” one of these constructs can be used to represent the system state and identify deadlocks. Weisfeiler-Leman algorithms are used on these objects, (15[1])which may be used to construct a static schedule by building one of these objects. In 2015, László Babai announced work on a problem named for these objects (15[1])that runs in quasipolynomial time. The expression D minus A gives a type of (*) Laplacian representing these objects. (10[1])One of these (10[1])objects (10[1])that obeys (10[1])the triangle inequality is used (10[1])as input (10[1])for the Christofides (10[1])algorithm. (10[1]-5[1])A minimum spanning tree (10[1])for these objects may be constructed with Kruskal’s algorithm. (10[2])Causal diagrams (10[1])may use the “directed acyclic” (10[2])form (10[1])of, (10[3])for 10 points, what objects that consist of (10[1])a collection of vertices connected by edges? (10[2])■END■ (10[1])