P-Matchings Parameterized by Treewidth

Juhi Chaudhary, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations


A matching is a subset of edges in a graph G that do not share an endpoint. A matching M is a P-matching if the subgraph of G induced by the endpoints of the edges of M satisfies property P. For example, if the property P is that of being a matching, being acyclic, or being disconnected, then we obtain an induced matching, an acyclic matching, and a disconnected matching, respectively. In this paper, we analyze the problems of the computation of these matchings from the viewpoint of Parameterized Complexity with respect to the parameter treewidth.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers
EditorsDaniël Paulusma, Bernard Ries
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages15
ISBN (Print)9783031433795
StatePublished - 1 Jan 2023
Event49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023 - Fribourg, Switzerland
Duration: 28 Jun 202330 Jun 2023

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume14093 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023


  • Exponential Time Hypothesis
  • Matching
  • Parameterized Algorithms
  • Treewidth

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'P-Matchings Parameterized by Treewidth'. Together they form a unique fingerprint.

Cite this