[HTML][HTML] MDSA: A Dynamic and Greedy Approach to Solve the Minimum Dominating Set Problem
The graph theory is one of the fundamental structures in computer science used to model
various scientific and engineering problems. Many problems within the graph theory are …
various scientific and engineering problems. Many problems within the graph theory are …
Polynomial-time approximation schemes for induced subgraph problems on fractionally tree-independence-number-fragile graphs
E Galby, A Munaro, S Yang - arxiv preprint arxiv:2402.18352, 2024 - arxiv.org
We investigate a relaxation of the notion of fractional treewidth-fragility, namely fractional
tree-independence-number-fragility. In particular, we obtain polynomial-time approximation …
tree-independence-number-fragility. In particular, we obtain polynomial-time approximation …
A Survey on Variant Domination Problems in Geometric Intersection Graphs
SJ Xu, CX Wang, Y Yang - Parallel Processing Letters, 2024 - World Scientific
Given a graph G with vertex set V, a subset S of V is called a dominating set of G if every
vertex is either in S or is adjacent to a vertex in S. There are a lot of variants for dominating …
vertex is either in S or is adjacent to a vertex in S. There are a lot of variants for dominating …
Recognizing geometric intersection graphs stabbed by a line
In this paper, we determine the computational complexity of recognizing two graph classes,
grounded L-graphs and stabbable grid intersection graphs. An L-shape is made by joining …
grounded L-graphs and stabbable grid intersection graphs. An L-shape is made by joining …
[PDF][PDF] Graph Width Parameters: from Structure to Algorithms
S Yang, A Munaro, D Barnes - 2024 - pure.qub.ac.uk
Solving a discrete optimization problem means seeking an optimal solution from finitely
many options. Most discrete optimization problems are computationally hard. To overcome …
many options. Most discrete optimization problems are computationally hard. To overcome …
Discriminating Code And Set Cover with K-Bend Paths
C Wang, SJ Xu - papers.ssrn.com
In this paper, we explore geometric discriminating code and set cover problems with k-bend
paths. We first demonstrate that both the discriminating code problem and the set cover …
paths. We first demonstrate that both the discriminating code problem and the set cover …