P-Matchings Parameterized by Treewidth

Juhi Chaudhary; Meirav Zehavi

doi:10.1007/978-3-031-43380-1_16

P-Matchings Parameterized by Treewidth

Juhi Chaudhary
, Meirav Zehavi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

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 language	English
Title of host publication	Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers
Editors	Daniël Paulusma, Bernard Ries
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	217-231
Number of pages	15
ISBN (Print)	9783031433795
DOIs	https://doi.org/10.1007/978-3-031-43380-1_16
State	Published - 1 Jan 2023
Event	49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023 - Fribourg, Switzerland Duration: 28 Jun 2023 → 30 Jun 2023

Publication series

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

Conference

Conference	49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023
Country/Territory	Switzerland
City	Fribourg
Period	28/06/23 → 30/06/23

Keywords

Exponential Time Hypothesis
Matching
Parameterized Algorithms
Treewidth

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-031-43380-1_16

Cite this

Chaudhary, J., & Zehavi, M. (2023). P-Matchings Parameterized by Treewidth. In D. Paulusma, & B. Ries (Eds.), Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers (pp. 217-231). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14093 LNCS). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-43380-1_16

Chaudhary, Juhi ; Zehavi, Meirav. / P-Matchings Parameterized by Treewidth. Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers. editor / Daniël Paulusma ; Bernard Ries. Springer Science and Business Media Deutschland GmbH, 2023. pp. 217-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d4377a9bebfa493da6819a0dcab7e87f,

title = "P-Matchings Parameterized by Treewidth",

abstract = "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.",

keywords = "Exponential Time Hypothesis, Matching, Parameterized Algorithms, Treewidth",

author = "Juhi Chaudhary and Meirav Zehavi",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.; 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023 ; Conference date: 28-06-2023 Through 30-06-2023",

year = "2023",

month = jan,

day = "1",

doi = "10.1007/978-3-031-43380-1\_16",

language = "English",

isbn = "9783031433795",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Science and Business Media Deutschland GmbH",

pages = "217--231",

editor = "Dani{\"e}l Paulusma and Bernard Ries",

booktitle = "Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers",

address = "Germany",

}

Chaudhary, J & Zehavi, M 2023, P-Matchings Parameterized by Treewidth. in D Paulusma & B Ries (eds), Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 14093 LNCS, Springer Science and Business Media Deutschland GmbH, pp. 217-231, 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023, Fribourg, Switzerland, 28/06/23. https://doi.org/10.1007/978-3-031-43380-1_16

P-Matchings Parameterized by Treewidth. / Chaudhary, Juhi; Zehavi, Meirav.
Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers. ed. / Daniël Paulusma; Bernard Ries. Springer Science and Business Media Deutschland GmbH, 2023. p. 217-231 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 14093 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - P-Matchings Parameterized by Treewidth

AU - Chaudhary, Juhi

AU - Zehavi, Meirav

PY - 2023/1/1

Y1 - 2023/1/1

N2 - 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.

AB - 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.

KW - Exponential Time Hypothesis

KW - Matching

KW - Parameterized Algorithms

KW - Treewidth

UR - https://www.scopus.com/pages/publications/85174542184

U2 - 10.1007/978-3-031-43380-1_16

DO - 10.1007/978-3-031-43380-1_16

M3 - Conference contribution

AN - SCOPUS:85174542184

SN - 9783031433795

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 217

EP - 231

BT - Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers

A2 - Paulusma, Daniël

A2 - Ries, Bernard

PB - Springer Science and Business Media Deutschland GmbH

T2 - 49th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2023

Y2 - 28 June 2023 through 30 June 2023

ER -

Chaudhary J, Zehavi M. P-Matchings Parameterized by Treewidth. In Paulusma D, Ries B, editors, Graph-Theoretic Concepts in Computer Science - 49th International Workshop, WG 2023, Revised Selected Papers. Springer Science and Business Media Deutschland GmbH. 2023. p. 217-231. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-031-43380-1_16