[HTML][HTML] Reconfiguration in bounded bandwidth and tree-depth
M Wrochna - Journal of Computer and System Sciences, 2018 - Elsevier
We show that several reconfiguration problems known to be PSPACE-complete remain so
even when limited to graphs of bounded bandwidth (and hence pathwidth and treewidth) …
even when limited to graphs of bounded bandwidth (and hence pathwidth and treewidth) …
Quasi-polynomial time approximation schemes for the maximum weight independent set problem in H-free graphs
In the Maximum Independent Set problem we are asked to find a set of pairwise
nonadjacent vertices in a given graph with the maximum possible cardinality. In general …
nonadjacent vertices in a given graph with the maximum possible cardinality. In general …
[HTML][HTML] Maximum Weight Independent Sets for (P7, triangle)-free graphs in polynomial time
A Brandstädt, R Mosca - Discrete Applied Mathematics, 2018 - Elsevier
Abstract The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs
with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum …
with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum …
A novel method for scheduling of wireless ad hoc networks in polynomial time
In this article, we address the scheduling problem in wireless ad hoc networks by exploiting
the computational advantage that comes when scheduling problems can be represented by …
the computational advantage that comes when scheduling problems can be represented by …
Structured hypergraphs in cellular mobile communication systems
A Ganesan - Proceedings of the 24th International Conference on …, 2023 - dl.acm.org
An open problem is to extend the results in the literature on unit disk graphs to hypergraph
models. Motivated by recent results that the worst-case performance of the distributed …
models. Motivated by recent results that the worst-case performance of the distributed …
Computing homomorphisms in hereditary graph classes: the peculiar case of the 5-wheel and graphs with no long claws
For graphs $ G $ and $ H $, an $ H $-coloring of $ G $ is an edge-preserving mapping from
$ V (G) $ to $ V (H) $. In the $ H $-Coloring problem the graph $ H $ is fixed and we ask …
$ V (G) $ to $ V (H) $. In the $ H $-Coloring problem the graph $ H $ is fixed and we ask …
Solving the stable set problem in terms of the odd cycle packing number
A Bock, Y Faenza, C Moldenhauer… - … on Foundation of …, 2014 - drops.dagstuhl.de
The classic stable set problem asks to find a maximum cardinality set of pairwise non-
adjacent vertices in an undirected graph G. This problem is NP-hard to approximate with …
adjacent vertices in an undirected graph G. This problem is NP-hard to approximate with …
Graph-theoretical dynamic user pairing for downlink NOMA systems
We propose a novel graph-theoretical dynamic user pairing strategy based on the user rate
requirements in cellular networks employing non-orthogonal multiple access (NOMA). The …
requirements in cellular networks employing non-orthogonal multiple access (NOMA). The …
A polytime preprocess algorithm for the maximum independent set problem
The maximum independent set (MIS) seeks to find a subset of vertices with the maximum
size such that no pair of its vertices are adjacent. This paper develops a recursive fixing …
size such that no pair of its vertices are adjacent. This paper develops a recursive fixing …
Scheduling wireless ad hoc networks in polynomial time using claw-free conflict graphs
In this paper, we address the scheduling problem in wireless ad hoc networks by exploiting
the computational advantage that comes when such scheduling problems can be …
the computational advantage that comes when such scheduling problems can be …