Journal of Combinatorial Theory Series B
Distributing resources in hypercube computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Efficient edge domination problems in graphs
Information Processing Letters
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Effincient Domination of Permutation Graphs and Trapezoid Graphs
COCOON '97 Proceedings of the Third Annual International Conference on Computing and Combinatorics
Perfect edge domination and efficient edge domination in graphs
Discrete Applied Mathematics
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
A Simple Linear Time LexBFS Cograph Recognition Algorithm
SIAM Journal on Discrete Mathematics
Graph Theory, Computational Intelligence and Thought
On the structure of (P5,gem)-free graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
On the complexity of the dominating induced matching problem in hereditary classes of graphs
Discrete Applied Mathematics
Efficient edge domination on hole-free graphs in polynomial time
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
| Hi-index | 0.00 |
Let G be a finite undirected graph with edge set E. An edge set E′⊆E is an induced matching in G if the pairwise distance of the edges of E′ in G is at least two; E′ is dominating in G if every edge e∈E&∖E′ intersects some edge in E′. The Dominating Induced Matching Problem (DIM, for short) asks for the existence of an induced matching E′ which is also dominating in G; this problem is also known as the Efficient Edge Domination Problem. The DIM problem is related to parallel resource allocation problems, encoding theory and network routing. It is $\mathbb{NP}$-complete even for very restricted graph classes such as planar bipartite graphs with maximum degree three. However, its complexity was open for Pk-free graphs for any k≥5; Pk denotes a chordless path with k vertices and k−1 edges. We show in this paper that the weighted DIM problem is solvable in linear time for P7-free graphs in a robust way.