Fast algorithms for some dominating induced matching problems (Q2015144): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2014.04.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2012724105
@@ Property / OpenAlex ID: W2012724105 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Edge Domination on Hole-Free Graphs in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Efficient Dominating and Edge Dominating Sets for Graphs and Hypergraphs
+Normal rank
@@ Property / cites work @@
+Dominating Induced Matchings for P 7-free Graphs in Linear Time
+Normal rank
@@ Property / cites work @@
+An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching
+Normal rank
@@ Property / cites work @@
+O(n) Time Algorithms for Dominating Induced Matching Problems
+Normal rank
@@ Property / cites work @@
+On the complexity of the dominating induced matching problem in hereditary classes of graphs
+Normal rank
@@ Property / 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.
+Normal rank
@@ Property / cites work @@
+Efficient edge domination problems in graphs
@@ Property / cites work: Efficient edge domination problems in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solving the weighted efficient edge domination problem on bipartite permutation graphs
+Normal rank
@@ Property / cites work @@
+Perfect edge domination and efficient edge domination in graphs
+Normal rank