Results 61 to 70 of about 11,505 (254)
Practical Access to Dynamic Programming on Tree Decompositions
Algorithms, 2019 Parameterized complexity theory has led to a wide range of algorithmic breakthroughs within the last few decades, but the practicability of these methods for real-world problems is still not well understood.
Max Bannach, Sebastian Berndt
doaj +1 more source
Tractable Inference for Hybrid Bayesian Networks with NAT-Modeled Dynamic Discretization
Proceedings of the International Florida Artificial Intelligence Research Society Conference, 2022 Hybrid BNs (HBNs) extend Bayesian networks (BNs) to both discrete and continuous variables. Among inference methods for HBNs, we focus on dynamic discretization (DD) that converts HBN to discrete BN for inference.
Yang Xiang, Hanwen Zheng
doaj +1 more source
TREEWIDTH and PATHWIDTH parameterized by vertex cover
, 2013 After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex Cover.
Chapelle, Mathieu +3 more
core +4 more sources
Treewidth Versus Clique Number. V. Further Connections With Tree‐Independence Number
Journal of Graph Theory, EarlyView.ABSTRACT We continue the study of ( tw , ω ) $({\mathsf{tw}},\omega )$‐bounded graph classes, that is, hereditary graph classes in which large treewidth is witnessed by the presence of a large clique, and the relation of this property to boundedness of the tree‐independence number, a graph parameter introduced independently by Yolov in 2018 and by ...
Claire Hilaire +2 more
wiley +1 more source
Intersection Dimension and Graph Invariants
Discussiones Mathematicae Graph Theory, 2021 We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ is at
Aravind N.R., Subramanian C.R.
doaj +1 more source
An Improved Quasi‐Isometry Between Graphs of Bounded Cliquewidth and Graphs of Bounded Treewidth
Journal of Graph Theory, EarlyView.ABSTRACT Cliquewidth is a dense analogue of treewidth. It can be deduced from recent results by Hickingbotham [arXiv:2501.10840] and Nguyen, Scott, and Seymour [arXiv:2501.09839] that graphs of bounded cliquewidth are quasi‐isometric to graphs of bounded treewidth.
Marc Distel
wiley +1 more source
Short note of supertree-width and n-Superhypertree-width [PDF]
Neutrosophic Sets and SystemsThis paper investigates the properties of tree-width and related graph width parameters for n SuperHyperGraphs, a broader generalization of hypergraphs.
Takaaki Fujita
doaj +1 more source
First-order queries on classes of structures with bounded expansion [PDF]
Logical Methods in Computer Science, 2020 We consider the evaluation of first-order queries over classes of databases with bounded expansion. The notion of bounded expansion is fairly broad and generalizes bounded degree, bounded treewidth and exclusion of at least one minor.
Wojtek Kazana, Luc Segoufin
doaj +1 more source
On Low Treewidth Approximations of Conjunctive Queries [PDF]
, 2012 We recently initiated the study of approximations of conjunctive queries within classes that admit tractable query evaluation (with respect to combined complexity).
Barcelo, Pablo +2 more
core +2 more sources
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source