1/9/2024 0 Comments Square root graph![]() Kannan, R.: Minkowski’s convex body theorem and integer programming. ![]() Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: Finding cactus roots in polynomial time. Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: A linear kernel for finding square roots of almost planar graphs. Golovach, P.A., Heggernes, P., Kratsch, D., Lima, P.T., Paulusma, D.: Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2. Algorithmica 62(1–2), 38–53 (2012)įrank, A., Tardos, E.: An application of simultaneous diophantine approximation in combinatorial optimization. 257, 158–174 (2019)įarzad, B., Lau, L.C., Le, V.B., Tuy, N.N.: Complexity of finding graph roots with girth conditions. ĭucoffe, G.: Finding cut-vertices in the square roots of a graph. Algorithmica 74(2), 602–629 (2016)Ĭochefert, M., Couturier, J., Golovach, P.A., Kratsch, D., Paulusma, D., Stewart, A.: Computing square roots of graphs with low maximum degree. 11:1–11:13 (2017)Ĭochefert, M., Couturier, J., Golovach, P.A., Kratsch, D., Paulusma, D.: Parameterized algorithms for finding square roots. In: Proceedings of the 11th International Symposium on Parameterized and Exact Computation, IPEC 2016. Springer, London (2008)Ĭhandran, S., Issac, D., Karrenbauer, A.: On the parameterized complexity of biclique cover and partition. Moreover, we point out that VC- \(k\) Root parameterized by k does not admit a subexponential kernel unless P= N P.īondy, J.A., Murty, U.S.R.: Graph Theory. Given a graph class \(\mathcal \) unless the Exponential Time Hypothesis fails.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |