Results 71 to 80 of about 5,860 (222)
A linear time algorithm for finding tree-decompositions of small treewidth
Symposium on the Theory of Computing, 1993 In this paper, we give for constant $k$ a linear-time algorithm that, given a graph $G=(V,E)$, determines whether the treewidth of $G$ is at most $k$ and, if so, finds a tree-decomposition of $G$ with treewidth at most $k$.
H. Bodlaender
semanticscholar +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
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
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
Exploiting Database Management Systems and Treewidth for Counting [PDF]
International Symposium on Practical Aspects of Declarative Languages, 2020 Bounded treewidth is one of the most cited combinatorial invariants in the literature. It was also applied for solving several counting problems efficiently.
J. Fichte +3 more
semanticscholar +1 more source
Induced subgraphs of bounded treewidth and the container method [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2020 A hole in a graph is an induced cycle of length at least 4. A hole is long if its length is at least 5. By $P_t$ we denote a path on $t$ vertices. In this paper we give polynomial-time algorithms for the following problems: the Maximum Weight Independent
Tara Abrishami +4 more
semanticscholar +1 more source
On the k-rainbow domination in graphs with bounded tree-width
Electronic Journal of Graph Theory and Applications, 2021 Given a positive integer k and a graph G = (V, E), a function f from V to the power set of Ik is called a k-rainbow function if for each vertex v ∈ V, f(v)=∅ implies ∪u ∈ N(v)f(u)=Ik where N(v) is the set of all neighbors of vertex v and Ik = {1, …, k ...
M. Alambardar Meybodi +3 more
doaj +1 more source
On Constrained Minimum Weight Edge Covers With Applications to Emergency Planning
Networks, Volume 85, Issue 3, Page 261-271, April 2025.ABSTRACT In this paper we present a new covering problem, called Min Cost q$$ q $$‐Single Location Cover, where we are given a fixed positive integer q$$ q $$, a finite ground set J$$ J $$, an integral positive demand dj$$ {d}_j $$ for each element j∈J$$ j\in J $$, a collection 𝒥 of subsets of J$$ J $$, an integral positive cost cS$$ {c}_S $$ and an ...
Shai Dimant, Sven O. Krumke
wiley +1 more source
Edge-trewidth: Algorithmic and combinatorial properties [PDF]
arXiv, 2021 We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of edge-treewidth. We first observe that edge-treewidth does not enjoy any closeness properties under the known partial ...
arxiv
The complexity of the perfect matching‐cut problem
Journal of Graph Theory, Volume 108, Issue 3, Page 432-462, March 2025.Abstract PERFECT MATCHING‐CUT is the problem of deciding whether a graph has a perfect matching that contains an edge‐cut. We show that this problem is NP‐complete for planar graphs with maximum degree four, for planar graphs with girth five, for bipartite five‐regular graphs, for graphs of diameter three, and for bipartite graphs of diameter four.
Valentin Bouquet, Christophe Picouleau
wiley +1 more source