O(n) Time Algorithms for Dominating Induced Matching Problems

DOI10.1007/978-3-642-54423-1_35zbMath1405.68143OpenAlexW2260246106MaRDI QIDQ5405059

Michel J. Mizrahi, Min Chih Lin, Jayme Luiz Szwarcfiter

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_35

zbMATH Keywords

algorithmsgraph theorydominating induced matchings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Fast algorithms for some dominating induced matching problems

This page was built for publication: O(n) Time Algorithms for Dominating Induced Matching Problems