On the complexity of minimum maximal uniquely restricted matching
From MaRDI portal
Publication:5925665
DOI10.1007/978-3-030-64843-5_25OpenAlexW3177457692MaRDI QIDQ5925665
Publication date: 21 March 2023
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-64843-5_25
matchingNP-completenessgraph algorithmsuniquely restricted matchingminimum maximal matching\textsf{APX}-completeness
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (1)
This page was built for publication: On the complexity of minimum maximal uniquely restricted matching
