Matches in SemOpenAlex for { <https://semopenalex.org/work/W54213734> ?p ?o ?g. }
- W54213734 endingPage "1736" @default.
- W54213734 startingPage "1726" @default.
- W54213734 abstract "The well-known Erdos-Posa theorem says that for any integer k and any graph G, either G contains k vertex-disjoint cycles or a vertex set X of order at most c·k log k (for some constant c) such that G - X is a forest. Thomassen [39] extended this result to the even cycles, but on the other hand, it is well-known that this theorem is no longer true for the odd cycles. However, Reed [31] proved that this theorem still holds if we relax k vertex-disjoint odd cycles to k odd cycles with each vertex in at most two of them. These theorems initiate many researches in both graph theory and theoretical computer science.In the graph theory side, our problem setting is that we are given a graph and a vertex set S, and we want to extend all the above results to cycles that are required to go through a subset of S, i.e., each cycle contains at least one vertex in S (such a cycle is called an S-cycle). It was shown in [20] that the above Erdos-Posa theorem still holds for this subset version. In this paper, we extend both Thomassen's result and Reed's result in this way.In the theoretical computer science side, we investigate generalizations of the following well-known problems in the framework of parameterized complexity: the feedback set problem and the cycle packing problem. Our purpose here is to consider the following problems: the feedback set problem with respect to the S-cycles, and the S-cycle packing problem.We give the first fixed parameter algorithms for the two problems. Namely;1. For fixed k, we can either find a vertex set X of size k such that G -- X has no S-cycle, or conclude that such a vertex set does not exist in O(n2m) time (independently obtained in [7]).2. For fixed k, we can either find k vertex-disjoint S-cycles, or conclude that such k disjoint cycles do not exist in O(n2m) time.We also extend the above results to those with the parity constraints as follows;1. For a parameter k, there exists a fixed parameter algorithm that either finds a vertex set X of size k such that G -- X has no evenS-cycle, or concludes that such a vertex set does not exist.2. For a parameter k, there exists a fixed parameter algorithm that either finds a vertex set X of size k such that G -- X has no odd S-cycle, or concludes that such a vertex set does not exist.3. For a parameter k, there exists a fixed parameter algorithm that either finds k vertex-disjoint evenS-cycles, or concludes that such k disjoint cycles do not exist.4. For a parameter k, there exists a fixed parameter algorithm that either finds k odd S-cycles with each vertex in at most two of them, or concludes that such k cycles do not exist." @default.
- W54213734 created "2016-06-24" @default.
- W54213734 creator A5008961593 @default.
- W54213734 creator A5047111221 @default.
- W54213734 creator A5074548000 @default.
- W54213734 date "2012-01-17" @default.
- W54213734 modified "2023-10-03" @default.
- W54213734 title "Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing" @default.
- W54213734 cites W1514063965 @default.
- W54213734 cites W1566660502 @default.
- W54213734 cites W1575434249 @default.
- W54213734 cites W1581643485 @default.
- W54213734 cites W1776142702 @default.
- W54213734 cites W1989287241 @default.
- W54213734 cites W1990800802 @default.
- W54213734 cites W1991755800 @default.
- W54213734 cites W1997576329 @default.
- W54213734 cites W2005079828 @default.
- W54213734 cites W2013023265 @default.
- W54213734 cites W2018366661 @default.
- W54213734 cites W2020381865 @default.
- W54213734 cites W2024517697 @default.
- W54213734 cites W2046069847 @default.
- W54213734 cites W2046999257 @default.
- W54213734 cites W2047739168 @default.
- W54213734 cites W2050352628 @default.
- W54213734 cites W2051856222 @default.
- W54213734 cites W2059563583 @default.
- W54213734 cites W2060363698 @default.
- W54213734 cites W2060765530 @default.
- W54213734 cites W2081145725 @default.
- W54213734 cites W2081880478 @default.
- W54213734 cites W2091737416 @default.
- W54213734 cites W2096113666 @default.
- W54213734 cites W2104713819 @default.
- W54213734 cites W2106524338 @default.
- W54213734 cites W2115589427 @default.
- W54213734 cites W2119500311 @default.
- W54213734 cites W2132677029 @default.
- W54213734 cites W2135517930 @default.
- W54213734 cites W2171796957 @default.
- W54213734 cites W2283515028 @default.
- W54213734 cites W2401610261 @default.
- W54213734 cites W2913688336 @default.
- W54213734 cites W2988480584 @default.
- W54213734 doi "https://doi.org/10.5555/2095116.2095253" @default.
- W54213734 hasPublicationYear "2012" @default.
- W54213734 type Work @default.
- W54213734 sameAs 54213734 @default.
- W54213734 citedByCount "7" @default.
- W54213734 countsByYear W542137342012 @default.
- W54213734 countsByYear W542137342013 @default.
- W54213734 countsByYear W542137342016 @default.
- W54213734 countsByYear W542137342017 @default.
- W54213734 countsByYear W542137342019 @default.
- W54213734 countsByYear W542137342020 @default.
- W54213734 crossrefType "proceedings-article" @default.
- W54213734 hasAuthorship W54213734A5008961593 @default.
- W54213734 hasAuthorship W54213734A5047111221 @default.
- W54213734 hasAuthorship W54213734A5074548000 @default.
- W54213734 hasConcept C114614502 @default.
- W54213734 hasConcept C118615104 @default.
- W54213734 hasConcept C132525143 @default.
- W54213734 hasConcept C157951044 @default.
- W54213734 hasConcept C165464430 @default.
- W54213734 hasConcept C203776342 @default.
- W54213734 hasConcept C22149727 @default.
- W54213734 hasConcept C28723256 @default.
- W54213734 hasConcept C33923547 @default.
- W54213734 hasConcept C45340560 @default.
- W54213734 hasConcept C80899671 @default.
- W54213734 hasConceptScore W54213734C114614502 @default.
- W54213734 hasConceptScore W54213734C118615104 @default.
- W54213734 hasConceptScore W54213734C132525143 @default.
- W54213734 hasConceptScore W54213734C157951044 @default.
- W54213734 hasConceptScore W54213734C165464430 @default.
- W54213734 hasConceptScore W54213734C203776342 @default.
- W54213734 hasConceptScore W54213734C22149727 @default.
- W54213734 hasConceptScore W54213734C28723256 @default.
- W54213734 hasConceptScore W54213734C33923547 @default.
- W54213734 hasConceptScore W54213734C45340560 @default.
- W54213734 hasConceptScore W54213734C80899671 @default.
- W54213734 hasLocation W542137341 @default.
- W54213734 hasOpenAccess W54213734 @default.
- W54213734 hasPrimaryLocation W542137341 @default.
- W54213734 hasRelatedWork W1517036688 @default.
- W54213734 hasRelatedWork W1533487312 @default.
- W54213734 hasRelatedWork W1570425181 @default.
- W54213734 hasRelatedWork W1979312598 @default.
- W54213734 hasRelatedWork W1997576329 @default.
- W54213734 hasRelatedWork W2016590962 @default.
- W54213734 hasRelatedWork W2024517697 @default.
- W54213734 hasRelatedWork W2040831377 @default.
- W54213734 hasRelatedWork W2046999257 @default.
- W54213734 hasRelatedWork W2051856222 @default.
- W54213734 hasRelatedWork W2059273723 @default.
- W54213734 hasRelatedWork W2075199819 @default.
- W54213734 hasRelatedWork W2079566953 @default.