Bounding twin-width for bounded-treewidth graphs, planar graphs, and bipartite graphs.
Hugo JacobMarcin PilipczukPublished in: CoRR (2022)
Keyphrases
- bipartite graph
- planar graphs
- bounded treewidth
- minimum weight
- np complete
- decision problems
- link prediction
- maximum cardinality
- graph model
- boolean functions
- conjunctive queries
- upper bound
- relational learning
- edge weights
- complex networks
- relational databases
- computational complexity
- inductive logic programming
- learning algorithm
- np hard
- decision trees