Upward and Orthogonal Planarity are W[1]-hard Parameterized by Treewidth.
Bart M. P. JansenLiana KhazaliyaPhilipp KindermannGiuseppe LiottaFabrizio MontecchianiKirill SimonovPublished in: CoRR (2023)
Keyphrases
- upper bound
- search space
- bounded treewidth
- discrete random variables
- space complexity
- real time
- line drawings
- machine learning
- artificial intelligence
- similarity measure
- bayesian networks
- special case
- graph structure
- boolean functions
- np complete
- probabilistic model
- data structure
- multiscale
- three dimensional
- data sets