Results 71 to 80 of about 996,556 (196)
Robust maximum weighted independent-set problems on interval graphs. [PDF]
We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertex weights. We use the absolute robustness criterion and the min-max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core
On the independent set interdiction problem
Electronic Journal of Graph Theory and Applications, 2015 The purpose of the independent set interdiction problem in the weighted graph $G$ is to determine a set of vertices $R^*$ such that the weight of the maximum independent set in $G-R^*$ is minimized.
Gholam Hassan Shirdel, Nasrin Kahkeshani
doaj +1 more source
Quantum Approximation for Wireless Scheduling
Applied Sciences, 2020 This paper proposes an application algorithm based on a quantum approximate optimization algorithm (QAOA) for wireless scheduling problems. QAOA is one of the promising hybrid quantum-classical algorithms to solve combinatorial optimization problems and ...
Jaeho Choi, Seunghyeok Oh, Joongheon Kim
doaj +1 more source
Robust maximum weighted independent-set problems on interval graphs
, 2014 We study the maximum weighted independent-set problem on interval graphs with uncertainty on the vertexweights.We use the absolute robustness criterion and the min–max regret criterion to evaluate solutions.
Leus, Roel, Talla Nobibon, Fabrice
core +1 more source
Modification of Robson's algorithm for finding maximum independent set in undirected graph [PDF]
, 2015 The problem of finding the maximum independent set of vertices in an undirected graph is considered.
Oksana S. Firyulina +3 more
core +1 more source
Missing Puzzle Pieces in the Performance Landscape of the Quantum Approximate Optimization Algorithm [PDF]
QuantumWe consider the maximum cut and maximum independent set problems on random regular graphs in the infinite-size limit, and calculate the energy densities achieved by QAOA for high degrees up to $d=100$.
Elisabeth Wybo, Martin Leib
doaj +1 more source
On the Complexity of the Maximum Independent Set Reconfiguration Problem [PDF]
, 2022 We study the complexity of the polynomially equivalent Minimum Vertex Cover Reconfiguration and Maximum Independent Set Reconfiguration problems on a variety of graph classes, which ask whether there exists a reconfiguration sequence between two ...
Chebaro, Ezzat
core
Shor’s bounds for the weighted independence number
Науковий вісник Ужгородського університету. Серія: Математика і інформатика, 2019 Application of a technique of dual Lagrangian quadratic bounds of N.Z. Shor to studying the Maximum Weighted Independent Set problem is described. By the technique, two such N.Z. Shor’s upper bounds are obtained.
П. І. Стецюк +1 more
doaj +1 more source
Maximum Independent Sets in Direct Products of Cycles or Trees with Arbitrary Graphs
Discussiones Mathematicae Graph Theory, 2015 The direct product of graphs G = (V (G),E(G)) and H = (V (H),E(H)) is the graph, denoted as G×H, with vertex set V (G×H) = V (G)×V (H), where vertices (x1, y1) and (x2, y2) are adjacent in G × H if x1x2 ∈ E(G) and y1y2 ∈ E(H). Let n be odd and m even. We
Paj Tjaša, Špacapan Simon
doaj +1 more source
Algorithmic Aspects of Some Variants of Domination in Graphs
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2020 A set S ⊆ V is a dominating set in G if for every u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E, i.e., N[S] = V . A dominating set S is an isolate dominating set (IDS) if the induced subgraph G[S] has at least one isolated vertex.
Kumar J. Pavan, Reddy P.Venkata Subba
doaj +1 more source