The GYO algorithm[1] 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.
Definition
A hypergraph is a generalization of a graph. Formally, a hypergraph consists of a set of vertices V, and of a set E of hyperedges, each of which is a subset of the vertices V. Given a hypergraph, we can define its primal graph as the undirected graph defined on the same set of vertices, in which we put an edge between any two vertices which occur together in some hyperedge.
A hypergraph H is α-acyclic if it satisfies two conditions: being chordal and being conformal. More precisely, we say that H is chordal if its primal graph is a chordal graph. We say that H is conformal if for every clique of the primal graph, there is a hyperedge of H containing all the vertices of the clique.
The GYO algorithm takes as input a hypergraph and determines if it is α-acyclic in this sense.
Principle of the algorithm
The algorithm iteratively removes so-called ears of the hypergraph, until the hypergraph is fully decomposed. It can be made to work in linear time.
References
- Abiteboul, Serge; Hull, Richard; Vianu, Victor (1994-12-02). Foundations of Databases: The Logical Level. Reading, Mass.: Pearson. ISBN 978-0-201-53771-0.
Notes
- ^ "An algorithm for tree-query membership of a distributed query | IEEE Conference Publication | IEEE Xplore". ieeexplore.ieee.org. Retrieved 2023-12-12.