On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
type: Item
instance of: scholarly article
title: On the complexity of minimum cardinality maximal uniquely restricted matching in graphs
zbMATH Open document ID: 1496.68267
DOI: 10.1007/978-3-319-64419-6_29
author: B. S. Panda
author: Arti Pandey
publication date: 2017-12-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6814592
zbMATH Keywords: matching
zbMATH Keywords: uniquely restricted matching
zbMATH Keywords: bipartite graphs
zbMATH Keywords: graph algorithm
zbMATH Keywords: NP-completeness
MaRDI profile type: Publication
full work available at URL: 978-3-319-64419-6 29
OpenAlex ID: W2748469983
description: scientific article; zbMATH DE number 6814592