Recognizing well-dominated graphs is coNP-complete.

Akanksha Agrawal Henning Fernau Philipp Kindermann Kevin Mann Uéverton S. Souza

Published in: CoRR (2022)

Keyphrases

graph isomorphism
conp complete
np complete
data exchange
decision problems
graph matching
graph mining
complexity theoretic
conjunctive queries
graph databases
graph data
graph search
subgraph isomorphism
np hard
data sets
data complexity
search space