Pages that link to "Item:Q411833"
From MaRDI portal
The following pages link to The most vital nodes with respect to independent set and vertex cover (Q411833):
Displaying 40 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Critical vertices and edges in \(H\)-free graphs (Q1730263) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- A dynamic reformulation heuristic for generalized interdiction problems (Q1754203) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Blocking total dominating sets via edge contractions (Q2034793) (← links)
- Reducing graph transversals via edge contractions (Q2037191) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Using edge contractions to reduce the semitotal domination number (Q2098176) (← links)
- Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) (← links)
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
- Reducing the chromatic number by vertex or edge deletions (Q2413179) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- The complexity of blocking (semi)total dominating sets with edge contractions (Q2690876) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- Contraction Blockers for Graphs with Forbidden Induced Paths (Q2947020) (← links)
- Interdicting Structured Combinatorial Optimization Problems with {0, 1}-Objectives (Q2976146) (← links)
- Study of the Matching Interdiction Problem in Some Molecular Graphs of Dendrimers (Q2980027) (← links)
- Blocking Independent Sets for H-Free Graphs via Edge Contractions and Vertex Deletions (Q2988844) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- Multilevel Approaches for the Critical Node Problem (Q4994170) (← links)
- On the Independent Set Interdiction Problem (Q5006560) (← links)
- Integer Programming Formulations for Minimum Spanning Tree Interdiction (Q5084609) (← links)
- (Q5089236) (← links)
- (Q5092403) (← links)
- Interdiction Games and Monotonicity, with Application to Knapsack Problems (Q5138270) (← links)
- Assistance and interdiction problems on interval graphs (Q6094722) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- Mixed integer bilevel optimization with a \(k\)-optimal follower: a hierarchy of bounds (Q6102856) (← links)
- On designing networks resilient to clique blockers (Q6106962) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)
- On blockers and transversals of maximum independent sets in co-comparability graphs (Q6585269) (← links)
- The robust chromatic number of graphs (Q6598012) (← links)
- Distance-preserving graph compression techniques (Q6616229) (← links)
- The critical node game (Q6645160) (← links)
