GYO algorithm: Difference between revisions

Content deleted Content added
Added tags to the page using Page Curation (uncategorised)
Line 1:
 
The '''GYO algorithm'''<ref name="yu79">{{Cite web |title=An algorithm for tree-query membership of a distributed query {{!}} IEEE Conference Publication {{!}} IEEE Xplore |url=https://ieeexplore.ieee.org/abstract/document/762509 |access-date=2023-12-12 |website=ieeexplore.ieee.org}}</ref> is an algorithm that applies to [[hypergraph]]s. The algorithm takes as input a hypergraph and determines if the hypergraph is [[Acyclic hypergraph|α-acyclic]]. If so, it computes a decomposition of the hypergraph.
 
Line 36 ⟶ 37:
 
<references/>
{{uncategorised|date=December 2023}}