Results 91 to 100 of about 5,081 (203)
Structural properties of graph products
Journal of Graph Theory, Volume 109, Issue 2, Page 107-136, June 2025.Abstract Dujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically studies various structural properties of cartesian, direct and strong products.
Robert Hickingbotham, David R. Wood
wiley +1 more source
Treewidth, crushing and hyperbolic volume [PDF]
, 2019 International audienceThe treewidth of a 3-manifold triangulation plays an important role in algorith-mic 3-manifold theory, and so it is useful to find bounds on the treewidth in terms of other properties of the manifold.
Maria, Clément, Purcell, Jessica
core +1 more source
Edge-treewidth: Algorithmic and combinatorial properties
, 2023 International audienceWe 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.
Loïc Magne +7 more
core +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
A Brief Overview of Applications of Tree-Width and Other Graph Width Parameters
Applied Mathematics on Science and EngineeringGraph theory, a fundamental branch of mathematics, centers on the study of networks composed of vertices (nodes) and edges, examining their paths, structures, and properties.
Takaaki Fujita
doaj +1 more source
Phylogenetic incongruence through the lens of Monadic Second Order logic
Journal of Graph Algorithms and Applications, 2016 Within the field of phylogenetics there is growing interest in measures for summarising the dissimilarity, or incongruence, of two or more phylogenetic trees. Many of these measures are NP-hard to compute and this has stimulated a considerable volume of
Steven Kelk +3 more
doaj +1 more source
Dominating sets and local treewidth
, 2003 It is known that the treewidth of a planar graph with a dominating set of size d is O(sqrt{d}) and this fact is used as the basis for several fixed parameter algorithms on planar graphs.
Fomin, Fedor V. +5 more
core +2 more sources
On the treewidth of toroidal grids
Discrete Applied Mathematics, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masashi Kiyomi +2 more
openaire +2 more sources
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
On Treewidth and Stable Marriage
CoRR, 2017 Stable Marriage is a fundamental problem to both computer science and economics. Four well-known NP-hard optimization versions of this problem are the Sex-Equal Stable Marriage (SESM), Balanced Stable Marriage (BSM), max-Stable Marriage with Ties (max-SMT) and min-Stable Marriage with Ties (min-SMT) problems.
Sushmita Gupta +2 more
openaire +2 more sources