Parameterized complexity of perfectly matched sets
type: Item
instance of: scholarly article
title: Parameterized complexity of perfectly matched sets
author: Akanksha Agrawal
author: Sutanay Bhattacharjee
author: Satyabrata Jana
author: Abhishek Sahu
published in: Theoretical Computer Science
publication date: 2023-05-02T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7681299
zbMATH Keywords: perfectly matched sets
zbMATH Keywords: parameterized complexity
zbMATH Keywords: apex-minor-free graphs
zbMATH Keywords: \(d\)-degenerate graphs
zbMATH Keywords: planar graphs
zbMATH Keywords: interval graphs
MaRDI profile type: Publication
full work available at URL: j.tcs.2023.113861
OpenAlex ID: W4362663715
cites work: Induced matchings in intersection graphs.
cites work: New results on maximum induced matchings in bipartite graphs and beyond
cites work: On the induced matching problem
cites work: Improved induced matchings in sparse graphs
cites work: The parameterized complexity of the induced matching problem
cites work: NP-completeness of some generalizations of the maximum matching problem
cites work: Q4944970
cites work: On the np-completeness of certain network testing problems
cites work: The complexity of the matching-cut problem for planar graphs and other graph classes
cites work: Matching cut in graphs with large minimum degree
cites work: Recognizing decomposable graphs
cites work: Q4636534
cites work: The perfect matching cut problem revisited
cites work: Matching cutsets in graphs
cites work: The Bidimensional Theory of Bounded-Genus Graphs
cites work: Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
cites work: Interval Deletion Is Fixed-Parameter Tractable
cites work: Graph Theory
cites work: Parameterized Algorithms
cites work: Q4503944
cites work: Parametrized complexity theory.
cites work: Q5710169
cites work: Interval graph representation with given interval and intersection lengths
cites work: Uniquely Restricted Matchings in Interval Graphs
cites work: Subexponential algorithms for partial cover problems
cites work: Extremal Combinatorics
DOI: 10.1016/J.TCS.2023.113861
Recommended article: Perfectly matched sets in graphs: parameterized and exact computation
Recommended article: The parameterized complexity of the induced matching problem
Recommended article: On the parameterized complexity of the acyclic matching problem
Recommended article: Q5092396
Recommended article: Parameterized complexity of conflict-free matchings and paths
Recommended article: Q3696522
Recommended article: Complexity of matching problems
Recommended article: Tight Lower Bounds on the Resolution Complexity of Perfect Matching Principles
Recommended article: Sublinear Algorithms for Parameterized Matching
Recommended article: Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
description: scientific article; zbMATH DE number 7681299