Extending the Tractability of the Clique Problem via Graph Classes Generalizing Treewidth.

Philippe Jégou

Published in: ISAIM (2024)

Keyphrases

bounded treewidth
tractable cases
tractable classes
np complete
constraint satisfaction problems
graph structure
quasi cliques
reasoning problems

maximum weight
directed graph
equivalence classes
graph representation
conjunctive queries
decision problems
maximum clique
upper bound

search space
graph properties
space complexity
random walk
independent set
tree decomposition
graph theory
bipartite graph

graph matching
class labels
image segmentation
maximum independent set
path consistency
relational learning
weighted graph
computational complexity