Results 221 to 222 of about 5,860 (222)
Some of the next articles are maybe not open access.
Co-Degeneracy and Co-Treewidth: Using the Complement to Solve Dense Instances
International Symposium on Mathematical Foundations of Computer Science, 2021Clique-width and treewidth are two of the most important and useful graph parameters, and several problems can be solved efficiently when restricted to graphs of bounded clique-width or treewidth.
Gabriel L. Duarte +2 more
semanticscholar +1 more source
Orthogonal planarity testing of bounded treewidth graphs
Journal of computer and system sciences (Print), 2021E. D. Giacomo +2 more
semanticscholar +1 more source