Clustering Graphs of Bounded Treewidth to Minimize the Sum of Radius-Dependent Costs.
Lukas DrexlerJan HöckendorffJoshua KönenKevin SchewiorPublished in: CoRR (2023)
Keyphrases
- bounded treewidth
- np complete
- graph theoretic
- decision problems
- conjunctive queries
- highly parallelizable
- clustering algorithm
- unsupervised learning
- bounded degree
- boolean functions
- data points
- special case
- relational learning
- fixed parameter tractable
- databases
- np hard
- objective function
- reinforcement learning
- machine learning