Sign in
Treewidth is NP-Complete on Cubic Graphs (and related results).
Hans L. Bodlaender
Édouard Bonnet
Lars Jaffke
Dusan Knop
Paloma T. Lima
Martin Milanic
Sebastian Ordyniak
Sukanya Pandey
Ondrej Suchý
Published in:
CoRR (2023)
Keyphrases
</>
np complete
bounded treewidth
polynomial time complexity
conjunctive queries
satisfiability problem
randomly generated
np hard
constraint satisfaction problems
neural network
upper bound
data management
graph theoretic
expressive power
graph theory
graph partitioning
tractable classes