Question

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, 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 that runs in quasipolynomial time. The expression D minus A gives a type of (*) Laplacian representing these objects. One of these objects that obeys the triangle inequality is used as input for the Christofides algorithm. A minimum spanning tree for these objects may be constructed with Kruskal’s algorithm. Causal diagrams may use the “directed acyclic” form of, (10[2])for 10 points, what objects that consist of (10[1])a collection of vertices connected by edges? ■END■

ANSWER: graphs [accept directed graphs; accept directed acyclic graphs; accept graph Laplacian; accept graph isomorphism problem; accept wait-for graph; accept DAGs; prompt on isomorphisms by asking “what other objects name that problem?”; reject “trees”]
<RA, Other Science: Computer Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Chinmay MurthyTexas AHCC11710
Dimitris KalafatisTAMUTexas C11710
Viraj NegandhiTexas BTAG Magnet: Taylor's Version12510

Summary