Fast algorithms for some dominating induced matching problems
type: Item
instance of: scholarly article
title: Fast algorithms for some dominating induced matching problems
zbMATH Open document ID: 1370.05170
author: Min Chih Lin
author: Michel J. Mizrahi
author: Jayme L. Szwarcfiter
published in: Information Processing Letters
publication date: 2014-06-23T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6306363
zbMATH Keywords: algorithms
zbMATH Keywords: dominating induced matchings
zbMATH Keywords: graph theory
MaRDI profile type: Publication
full work available at URL: j.ipl.2014.04.012
OpenAlex ID: W2012724105
cites work: Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
cites work: Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
cites work: Dominating Induced Matchings for P 7-free Graphs in Linear Time
cites work: An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching
cites work: O(n) Time Algorithms for Dominating Induced Matching Problems
cites work: On the complexity of the dominating induced matching problem in hereditary classes of graphs
cites work: Tight upper bound on the number of edges in a bipartite \(K_{3,3}\)-free or \(K_{5}\)-free graph with an application.
cites work: Efficient edge domination problems in graphs
cites work: Solving the weighted efficient edge domination problem on bipartite permutation graphs
cites work: Perfect edge domination and efficient edge domination in graphs
DOI: 10.1016/J.IPL.2014.04.012
description: scientific article; zbMATH DE number 6306363