Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Aoike, Yuuki"'
In this note, we consider the problem of finding a step-by-step transformation between two longest increasing subsequences in a sequence, namely Longest Increasing Subsequence Reconfiguration. We give a polynomial-time algorithm for deciding whether
Externí odkaz:
http://arxiv.org/abs/2310.01066
Autor:
Aoike, Yuuki, Gima, Tatsuya, Hanaka, Tesshu, Kiyomi, Masashi, Kobayashi, Yasuaki, Kobayashi, Yusuke, Kurita, Kazuhiro, Otachi, Yota
A cactus is a connected graph that does not contain $K_4 - e$ as a minor. Given a graph $G = (V, E)$ and integer $k \ge 0$, Cactus Vertex Deletion (also known as Diamond Hitting Set) is the problem of deciding whether $G$ has a vertex set of size at
Externí odkaz:
http://arxiv.org/abs/2012.04910
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Aoike, Yuuki1 (AUTHOR), Gima, Tatsuya2 (AUTHOR), Hanaka, Tesshu2 (AUTHOR), Kiyomi, Masashi3 (AUTHOR), Kobayashi, Yasuaki4 (AUTHOR) kobayashi@iip.ist.i.kyoto-u.ac.jp, Kobayashi, Yusuke5 (AUTHOR), Kurita, Kazuhiro6 (AUTHOR), Otachi, Yota2 (AUTHOR)
Publikováno v:
Theory of Computing Systems. Apr2022, Vol. 66 Issue 2, p502-515. 14p.
