The structure and maximum number of maximum independent sets in trees
Journal of Graph Theory
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A polynomial algorithm for the k-cut problem for fixed k
Mathematics of Operations Research
Discrete linear bilevel programming problem
Journal of Optimization Theory and Applications
Bipartite graphs and their applications
Bipartite graphs and their applications
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the number of vertices belonging to all maximum stable sets of a graph
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
NP-completeness results for edge modification problems
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
Theory of Computing Systems
The most vital nodes with respect to independent set and vertex cover
Discrete Applied Mathematics
d-Transversals of stable sets and vertex covers in weighted bipartite graphs
Journal of Discrete Algorithms
| Hi-index | 0.01 |
We consider a set V of elements and an optimization problem on V: the search for a maximum (or minimum) cardinality subset of V verifying a given property 驴. A d-transversal is a subset of V which intersects any optimum solution in at least d elements while a d-blocker is a subset of V whose removal deteriorates the value of an optimum solution by at least d. We present some general characteristics of these problems, we review some situations which have been studied (matchings, s---t paths and s---t cuts in graphs) and we study d-transversals and d-blockers of stable sets or vertex covers in bipartite and in split graphs.