Parameterized complexity of conflict-free matchings and paths
Journal article, Peer reviewed
MetadataShow full item record
Original versionLeibniz International Proceedings in Informatics. 2019, 138, 35:1--35:15 10.4230/LIPIcs.MFCS.2019.35
An input to a conflict-free variant of a classical problem Gamma, called Conflict-Free Gamma, consists of an instance I of Gamma coupled with a graph H, called the conflict graph. A solution to Conflict-Free Gamma in (I,H) is a solution to I in Gamma, which is also an independent set in H. In this paper, we study conflict-free variants of Maximum Matching and Shortest Path, which we call Conflict-Free Matching (CF-Matching) and Conflict-Free Shortest Path (CF-SP), respectively. We show that both CF-Matching and CF-SP are W-hard, when parameterized by the solution size. Moreover, W-hardness for CF-Matching holds even when the input graph where we want to find a matching is itself a matching, and W-hardness for CF-SP holds for conflict graph being a unit-interval graph. Next, we study these problems with restriction on the conflict graphs. We give FPT algorithms for CF-Matching when the conflict graph is chordal. Also, we give FPT algorithms for both CF-Matching and CF-SP, when the conflict graph is d-degenerate. Finally, we design FPT algorithms for variants of CF-Matching and CF-SP, where the conflicting conditions are given by a (representable) matroid.