On the complexity of the dominating induced matching problem in hereditary classes of graphs.
Domingos Moreira CardosoNicholas KorpelainenVadim V. LozinPublished in: Discret. Appl. Math. (2011)
Keyphrases
- graph matching
- tractable cases
- matching algorithm
- complexity measures
- computational complexity
- maximum cardinality
- pattern matching
- computational cost
- pairwise
- object recognition
- worst case
- graph structure
- matching process
- undirected graph
- graph representation
- subgraph isomorphism
- bounded treewidth
- class hierarchy
- algebraic structures
- bayesian networks