[HTML][HTML] The most vital nodes with respect to independent set and vertex cover
Given an undirected graph with weights on its vertices, the k most vital nodes independent
set (k most vital nodes vertex cover) problem consists of determining a set of k vertices …
set (k most vital nodes vertex cover) problem consists of determining a set of k vertices …
Reducing the clique and chromatic number via edge contractions and vertex deletions
We consider the following problem: can a certain graph parameter of some given graph G
be reduced by at least d, for some integer d, via at most k graph operations from some …
be reduced by at least d, for some integer d, via at most k graph operations from some …
Blockers for the stability number and the chromatic number
Given an undirected graph G=(V, E) and two positive integers k and d, we are interested in
finding a set of edges (resp. non-edges) of size at most k to delete (resp. to add) in such a …
finding a set of edges (resp. non-edges) of size at most k to delete (resp. to add) in such a …
Complexity of determining the most vital elements for the 1-median and 1-center location problems
C Bazgan, S Toubaline, D Vanderpooten - International Conference on …, 2010 - Springer
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the 1-
median and 1-center location problems. Given a weighted connected graph with distances …
median and 1-center location problems. Given a weighted connected graph with distances …
Contraction blockers for graphs with forbidden induced paths
We consider the following problem: can a certain graph parameter of some given graph be
reduced by at least d for some integer d via at most k edge contractions for some given …
reduced by at least d for some integer d via at most k edge contractions for some given …
Complexity of determining the most vital elements for the p-median and p-center location problems
C Bazgan, S Toubaline, D Vanderpooten - Journal of Combinatorial …, 2013 - Springer
We consider the k most vital edges (nodes) and min edge (node) blocker versions of the p-
median and p-center location problems. Given a weighted connected graph with distances …
median and p-center location problems. Given a weighted connected graph with distances …
A large and natural Class of - and -complete Problems in Bilevel and Robust Optimization
C Grüne, L Wulf - arxiv preprint arxiv:2311.10540, 2023 - arxiv.org
Because $\Sigma^ p_2 $-and $\Sigma^ p_3 $-hardness proofs are usually tedious and
difficult, not so many complete problems for these classes are known. This is especially true …
difficult, not so many complete problems for these classes are known. This is especially true …
[PDF][PDF] CONSERVATOIRE NATIONAL DES ARTS ET MÉTIERS
MC Marie-Christine - 2016 - cedric.cnam.fr
Résumé Dans cette thèse, nous étudions trois catégories de problèmes: les d-extensibles,
les d-bloqueurs et les d-transversaux. Les d-extensibles de stables optimaux sont des …
les d-bloqueurs et les d-transversaux. Les d-extensibles de stables optimaux sont des …
d-extensibles, d-bloqueurs et d-transversaux de problèmes d'optimisation combinatoire
G Cotté - 2016 - theses.hal.science
Dans cette thèse, nous étudions trois catégories de problèmes: les d-extensibles, les d-
bloqueurs et les d-transversaux. Les d-extensibles de stables optimaux sont des ensembles …
bloqueurs et les d-transversaux. Les d-extensibles de stables optimaux sont des ensembles …
[PDF][PDF] DISZKRÉT STRUKTÚRÁK KUTATÓCSOPORT
ES KUTATÓCSOPORT - Discrete Mathematics, 2011 - sztaki.hun-ren.hu
18. Ter Beek, M.-Csuhaj Varjú, E.-Holzer, M.-Vaszil, G.: Cooperating distributed grammar
systems: components with nonincreasing competence. In: Computation, cooperation, and …
systems: components with nonincreasing competence. In: Computation, cooperation, and …