Results 71 to 80 of about 278 (179)
Journal of Graph Theory, 2016 AbstractTreewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This article surveys several graph parameters tied to treewidth, including separation number, tangle number, well‐linked number, and Cartesian tree product number.
Daniel J. Harvey, David R. Wood
openaire +4 more sources
Exact Solutions for the Moving Firefighter Problem on Trees
Networks, Volume 88, Issue 1, Page 42-58, July 2026.ABSTRACT The moving firefighter problem (MFP) is a more realistic variant of the classic firefighter problem (FP), where firefighters require time for both travel and defense. Unfortunately, the only known exact solution for the MFP does not scale. In this paper, we establish that the MFP is NP‐complete on trees of maximum degree three and present four
Mauro A. Montenegro‐Meza +4 more
wiley +1 more source
Optimal Padded Decomposition For Bounded Treewidth Graphs [PDF]
TheoretiCSA $(β,δ,Δ)$-padded decomposition of an edge-weighted graph $G = (V,E,w)$ is a stochastic decomposition into clusters of diameter at most $Δ$ such that for every vertex $v\in V$, the probability that $\rm{ball}_G(v,γΔ)$ is entirely contained in the ...
Arnold Filtser +6 more
doaj +1 more source
Mathematics, 2023 Considering the worst-case scenario, the junction-tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees.
Alexander Bauer +2 more
doaj +1 more source
Recoloring via Modular Decomposition
Journal of Graph Theory, Volume 111, Issue 4, Page 113-123, April 2026.ABSTRACT The reconfiguration graph of the k‐colorings of a graph G, denoted R k ( G ), is the graph whose vertices are the k‐colorings of G and two colorings are adjacent in R k ( G ) if they differ in color on exactly one vertex. A graph G is said to be recolorable if R ℓ ( G ) is connected for all ℓ ≥ χ ( G ) + 1.
Manoj Belavadi +2 more
wiley +1 more source
Perfect Matching Under Precedence Constraints
Networks, Volume 87, Issue 2, Page 175-190, March 2026.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
wiley +1 more source
Size‐Ramsey Numbers of Structurally Sparse Graphs
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Size‐Ramsey numbers are a central notion in combinatorics and have been widely studied since their introduction by Erdős, Faudree, Rousseau, and Schelp in 1978. Research has mainly focused on the size‐Ramsey numbers of n$$ n $$‐vertex graphs with constant maximum degree Δ$$ \Delta $$.
Nemanja Draganić +4 more
wiley +1 more source
On the parameterized complexity of computing tree-partitions [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe study the parameterized complexity of computing the tree-partition-width, a graph parameter equivalent to treewidth on graphs of bounded maximum degree.
Hans L. Bodlaender +2 more
doaj +1 more source
Expert Systems, Volume 43, Issue 3, March 2026.ABSTRACT Zero‐day exploits remain challenging to detect because they often appear in unknown distributions of signatures and rules. The article entails a systematic review and cross‐sectional synthesis of four fundamental model families for identifying zero‐day intrusions, namely, convolutional neural networks (CNN), deep neural networks (DNN ...
Abdullah Al Siam +3 more
wiley +1 more source
On the tree-width of knot diagrams
Journal of Computational Geometry, 2019 We show that a small tree-decomposition of a knot diagram induces a small sphere-decomposition of the corresponding knot. This, in turn, implies that the knot admits a small essential planar meridional surface or a small bridge sphere.
Saul Schleimer +3 more
doaj +1 more source