Finding Dominating Induced Matchings in $S_{2, 2, 3}$-Free Graphs in Polynomial Time.

Andreas Brandstädt Raffaele Mosca

Published in: CoRR (2017)

Keyphrases

special case
graph isomorphism
maximum cardinality
computational complexity
database
learning algorithm
graph matching
series parallel
polynomial time complexity
random walk
directed graph
approximation algorithms
graph partitioning
graph representation
graph theoretic