The GYO algorithm is an algorithm that applies to hypergraphs. The algorithm takes as input a hypergraph and determines if the hypergraph is α-acyclic. If so, it computes a decomposition of the hypergraph.
The algorithm was proposed in 1979 by Graham and independently by Yu and Özsoyoğlu, hence its name.