Finding dominating induced matchings in S2, 2, 3-free graphs in polynomial time.

Andreas Brandstädt Raffaele Mosca

Published in: Discret. Appl. Math. (2020)

Keyphrases

maximum cardinality
graph isomorphism
computational complexity
special case
multi objective
graph theory
graph theoretic
polynomial time complexity
database
lower bound
graph matching
approximation algorithms
graph representation
graph data
bounded treewidth