On the complexity of minimum cardinality maximal uniquely restricted matching in graphs

DOI10.1007/978-3-319-64419-6_29zbMath1496.68267OpenAlexW2748469983MaRDI QIDQ1683558

Arti Pandey, B. S. Panda

Publication date: 1 December 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-64419-6_29

zbMATH Keywords

matchinggraph algorithmNP-completenessbipartite graphsuniquely restricted matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Minimum maximal acyclic matching in proper interval graphs ⋮ On the complexity of minimum maximal acyclic matchings ⋮ On the complexity of minimum maximal uniquely restricted matching

This page was built for publication: On the complexity of minimum cardinality maximal uniquely restricted matching in graphs