Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Dublois, Louis"'
An upper dominating set is a minimal dominating set in a graph. In the \textsc{Upper Dominating Set} problem, the goal is to find an upper dominating set of maximum size. We study the complexity of parameterized algorithms for \textsc{Upper Dominatin
Externí odkaz:
http://arxiv.org/abs/2101.07550
Autor:
Dublois, Louis, Hanaka, Tesshu, Ghadikolaei, Mehdi Khosravian, Lampis, Michael, Melissinos, Nikolaos
We study the approximability of the NP-complete \textsc{Maximum Minimal Feedback Vertex Set} problem. Informally, this natural problem seems to lie in an intermediate space between two more well-studied problems of this type: \textsc{Maximum Minimal
Externí odkaz:
http://arxiv.org/abs/2009.09971
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23 no. 1, Discrete Algorithms (April 30, 2021) dmtcs:6824
A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions. In particul
Externí odkaz:
http://arxiv.org/abs/1911.08964
Publikováno v:
In Theoretical Computer Science 26 June 2022 923:271-291
Autor:
Dublois, Louis, Hanaka, Tesshu, Khosravian Ghadikolaei, Mehdi, Lampis, Michael, Melissinos, Nikolaos
Publikováno v:
In Journal of Computer and System Sciences March 2022 124:26-40
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.