| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 429670 | Journal of Computer and System Sciences | 2010 | 15 Pages |
Abstract
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai–Luks Tournament Canonization algorithm (Babai and Luks (1983) [4]), we give an nO(k2+logn) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
