Dominating induced matchings for P _7-free graphs in linear time
From MaRDI portal
Publication:3104604
\(P _{7}\)-free graphsdominating induced matchingefficient edge dominationlinear-time algorithmrobust algorithm
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- Dominating induced matching in some subclasses of bipartite graphs
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
Cited in
(10)- Perfect edge domination: hard and solvable cases
- Weighted efficient domination for some classes of H-free and of (H₁, H₂)-free graphs
- Fast algorithms for some dominating induced matching problems
- Dominating induced matchings in \(S_{1 , 2 , 4}\)-free graphs
- Finding dominating induced matchings in \(S_{2, 2, 3}\)-free graphs in polynomial time
- Dominating induced matchings for \(P_7\)-free graphs in linear time
- The Maximum Number of Dominating Induced Matchings
- Exact algorithms for minimum weighted dominating induced matching
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time
- Finding dominating induced matchings in \(S_{1, 1, 5}\)-free graphs in polynomial time
This page was built for publication: Dominating induced matchings for \(P _{7}\)-free graphs in linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104604)
