Recognizing well-dominated graphs is coNP-complete.

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

Published in: Inf. Process. Lett. (2024)

Keyphrases

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