The Library
Dominating induced matchings
Tools
Tools
Tools
Cardoso, Domingos M. and Lozin, Vadim V. (2009) Dominating induced matchings. Lecture Notes in Computer Science, Vol.5420 . pp. 77-86. doi:10.1007/978-3-642-02029-2_8
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1007/978-3-642-02029-2_8
Abstract
We study the problem of determining whether or not a graph G has an induced matching that dominates every edge of the graph, which is also known as efficient edge domination. This problem is known to be NP-complete in general as well as in some restricted domains, such as bipartite graphs or regular graphs. In this paper, we identify a graph parameter to which the complexity of the problem is sensible and produce results of both negative (intractable) and positive (solvable in polynomial time) type.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Science > Mathematics | ||||
| Journal or Publication Title: | Lecture Notes in Computer Science | ||||
| Publisher: | Springer | ||||
| ISSN: | 0302-9743 | ||||
| Book Title: | Graph Theory, Computational Intelligence and Thought | ||||
| Official Date: | 2009 | ||||
| Dates: |
|
||||
| Volume: | Vol.5420 | ||||
| Page Range: | pp. 77-86 | ||||
| DOI: | 10.1007/978-3-642-02029-2_8 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
