KERNELIZATION ALGORITHMS FOR A GENERALIZATION OF THE COMPONENT ORDER CONNECTIVITY PROBLEM
-
- Shirahashi Masataka
- Kyushu University
-
- Kamiyama Naoyuki
- Kyushu University
Search this article
Abstract
<p>In the component order connectivity problem, we are given a finite undirected graph G = (V,E) and non-negative integers k, ℓ. The goal of this problem is to determine whether there exists a subset S ⊆ V such that |S| ≤ k and the size of every connected component of the subgraph of G induced by V \ S is at most ℓ. In this paper, we consider the generalization of the component order connectivity problem where the condition on the sizes of connected components is generalized by non-decreasing subadditive functions defined on the subsets of V. We prove that the kernelization techniques for the component order connectivity problem proposed by Xiao can be generalized to our setting.</p>
Journal
-
- Journal of the Operations Research Society of Japan
-
Journal of the Operations Research Society of Japan 66 (2), 112-129, 2023-04-30
The Operations Research Society of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390859016476375040
-
- NII Book ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL BIB ID
- 032810744
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- NDL
- Crossref
- KAKEN
-
- Abstract License Flag
- Disallowed