From 5609780aa0a4d8bb150dbf7261a0a3eaa0204025 Mon Sep 17 00:00:00 2001 From: Matthias Walter Date: Thu, 7 Dec 2023 21:53:12 +0100 Subject: [PATCH] Improved documentation --- doc/tu.md | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/doc/tu.md b/doc/tu.md index 78b0dbb8..d6151e3e 100644 --- a/doc/tu.md +++ b/doc/tu.md @@ -46,8 +46,9 @@ Please cite the paper in case the implementation contributed to your research: } In order to repeat experiments described in the paper above, the function can be parameterized as to use exponential-time algorithms. -The first is based on the criterion of Ghouila-Houri and runs in time \f$ \mathcal{O}( (m + n) 3^{\min(m, n)}) \f$. -The second enumerates square [Eulerian submatrices](https://www.ams.org/journals/proc/1965-016-05/S0002-9939-1965-0180568-2/) and runs in time \f$ \mathcal{O}( (m+n) 2^{ m + n } ) \f$. + + - The first is based on the criterion of Ghouila-Houri and runs in time \f$ \mathcal{O}( (m + n) \cdot 3^{\min(m, n)}) \f$. + - The second enumerates square [Eulerian submatrices](https://www.ams.org/journals/proc/1965-016-05/S0002-9939-1965-0180568-2/) and runs in time \f$ \mathcal{O}( (m+n) \cdot 2^{ m + n } ) \f$. ## C Interface ##