O(n) Time Algorithms for Dominating Induced Matching Problems

2014 ◽  
pp. 399-408 ◽  
Author(s):  
Min Chih Lin ◽  
Michel J. Mizrahi ◽  
Jayme L. Szwarcfiter
Keyword(s):  
Induced Matching ◽  
Matching Problems ◽  
Dominating Induced Matching

Fast algorithms for some dominating induced matching problems

2014 ◽  
Vol 114 (10) ◽  
pp. 524-528 ◽  
Author(s):  
Min Chih Lin ◽  
Michel J. Mizrahi ◽  
Jayme L. Szwarcfiter
Keyword(s):  
Fast Algorithms ◽  
Induced Matching ◽  
Matching Problems ◽  
Dominating Induced Matching

Exact Algorithms for Minimum Weighted Dominating Induced Matching

Algorithmica ◽  
2015 ◽  
Vol 77 (3) ◽  
pp. 642-660 ◽  
Author(s):  
Min Chih Lin ◽  
Michel J. Mizrahi ◽  
Jayme L. Szwarcfiter
Keyword(s):  
Exact Algorithms ◽  
Induced Matching ◽  
Dominating Induced Matching

scholarly journals Approximability results for the maximum and minimum maximal induced matching problems

2008 ◽  
Vol 5 (3) ◽  
pp. 584-593 ◽  
Author(s):  
Yury Orlovich ◽  
Gerd Finke ◽  
Valery Gordon ◽  
Igor Zverovich
Keyword(s):  
Induced Matching ◽  
Matching Problems

scholarly journals On the dominating induced matching problem: Spectral results and sharp bounds

2018 ◽  
Vol 234 ◽  
pp. 22-31 ◽  
Author(s):  
Enide Andrade ◽  
Domingos M. Cardoso ◽  
Luis Medina ◽  
Oscar Rojo
Keyword(s):  
Matching Problem ◽  
Induced Matching ◽  
Sharp Bounds ◽  
Dominating Induced Matching

scholarly journals On the complexity of the dominating induced matching problem in hereditary classes of graphs

2011 ◽  
Vol 159 (7) ◽  
pp. 521-531 ◽  
Author(s):  
Domingos M. Cardoso ◽  
Nicholas Korpelainen ◽  
Vadim V. Lozin
Keyword(s):  
Matching Problem ◽  
Induced Matching ◽  
Dominating Induced Matching

scholarly journals A note on the NP-hardness of two matching problems in induced subgrids

2013 ◽  
Vol Vol. 15 no. 2 (Graph Theory) ◽  
Author(s):  
Marc Demange ◽  
Tınaz Ekim
Keyword(s):  
General Framework ◽  
Maximum Size ◽  
Minimum Size ◽  
Unified Approach ◽  
Research Topics ◽  
Research Directions ◽  
Induced Matching ◽  
Matching Problems ◽  
International Audience ◽  
Np Hardness

Graph Theory International audience Given a graph, finding the maximal matching of minimum size (MMM) and the induced matching of maximum size (MIM) have been very popular research topics during the last decades. In this paper, we give new complexity results, namely the NP-hardness of MMM and MIM in induced subgrids and we point out some promising research directions. We also sketch the general framework of a unified approach to show the NP-hardness of some problems in subgrids.

Sign in / Sign up

Export Citation Format

Share Document