The following pages link to Blockers and transversals (Q1043948):
Displaying 34 items.
- Minimum edge blocker dominating set problem (Q319914) (← links)
- Minimum \(d\)-blockers and \(d\)-transversals in graphs (Q411244) (← links)
- The most vital nodes with respect to independent set and vertex cover (Q411833) (← links)
- On the NP-completeness of the perfect matching free subgraph problem (Q418003) (← links)
- Blockers for the stability number and the chromatic number (Q489343) (← links)
- Blocking optimal arborescences (Q507342) (← links)
- Matching interdiction (Q602686) (← links)
- Minimum cost edge blocker clique problem (Q827246) (← links)
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid (Q1045154) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- Blocking unions of arborescences (Q1751195) (← links)
- Connectivity interdiction (Q1785279) (← links)
- Complexity of determining the most vital elements for the \(p\)-median and \(p\)-center location problems (Q1944389) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under weighted \(l_1\) norm (Q2022299) (← links)
- Minimum \(k\)-critical bipartite graphs (Q2043356) (← links)
- Complexity and algorithms for constant diameter augmentation problems (Q2072060) (← links)
- Relating dissociation, independence, and matchings (Q2081478) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Using edge contractions and vertex deletions to reduce the independence number and the clique number (Q2169976) (← links)
- Feedback robustness in structured closed-loop system (Q2220064) (← links)
- Maximum shortest path interdiction problem by upgrading edges on trees under Hamming distance (Q2230789) (← links)
- Multiple bipartite complete matching vertex blocker problem: complexity, polyhedral analysis and branch-and-cut (Q2299979) (← links)
- On the complexity of the identifiable subgraph problem, revisited (Q2357777) (← links)
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs (Q2376794) (← links)
- Critical edges for the assignment problem: complexity and exact resolution (Q2450758) (← links)
- An accelerating algorithm for maximum shortest path interdiction problem by upgrading edges on trees under unit Hamming distance (Q2688925) (← links)
- (Q2857332) (← links)
- Complexity of Most Vital Nodes for Independent Set in Graphs Related to Tree Structures (Q3000504) (← links)
- Detecting critical node structures on graphs: A mathematical programming approach (Q4628045) (← links)
- On anti-Kekulé and \(s\)-restricted matching preclusion problems (Q6039537) (← links)
- Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)
- Connections between graphs and matrix spaces (Q6074039) (← links)
- A survey on mixed-integer programming techniques in bilevel optimization (Q6114905) (← links)
- Reducing graph parameters by contractions and deletions (Q6119833) (← links)
