On structural parameterizations of the matching cut problem
type: Item
instance of: scholarly article
title: On structural parameterizations of the matching cut problem
zbMATH Open document ID: 1472.68071
DOI: 10.1007/978-3-319-71147-8_34
author: N. R. Aravind
author: Subrahmanyam Kalyanasundaram
author: Anjeneya Swami Kare
publication date: 2018-03-26T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6852665
zbMATH Keywords: matching cut
zbMATH Keywords: decomposable graphs
zbMATH Keywords: parameterized algorithm
MaRDI profile type: Publication
full work available at URL: 978-3-319-71147-8 34
OpenAlex ID: W2770541954
Recommended article: Structural and algorithmic properties for parametric minimum cuts
Recommended article: Q4448767
Recommended article: A Parameterized Algorithm for Mixed-Cut
Recommended article: Q5875545
Recommended article: Q4636534
Recommended article: Q3014297
Recommended article: The perfect matching cut problem revisited
Recommended article: Matching cutsets in graphs
Recommended article: A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter
description: scientific article; zbMATH DE number 6852665