Finding dominating induced matchings in S1, 1, 5-free graphs in polynomial time.

Andreas Brandstädt Raffaele Mosca

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

Keyphrases

series parallel
special case
approximation algorithms
database
data mining
computational complexity
query language
strongly connected