2 papers
cs.DS2026
Parameterized Complexity of Odd Domination and its Generalization
Toranosuke Kokai, Rin Saito, Tatsuhiro Suga +2
In the \textsc{Odd Domination} problem, given a graph and a positive integer , the task is to determine whether there exists a vertex subset of such that the closed…
cs.DS2025
Spanning Trees with a Small Vertex Cover: the Complexity on Specific Graph Classes
Toranosuke Kokai, Akira Suzuki, Takahiro Suzuki +2
In the context of algorithm theory, various studies have been conducted on spanning trees with desirable properties. In this paper, we consider the \textsc{Minimum Cover Spanning T…