Minimum d-blockers and d-transversals in graphs
From MaRDI portal
Recommendations
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
- scientific article; zbMATH DE number 6000604
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2230201 (Why is no real title available?)
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A constructive characterization of trees with at least k disjoint maximum matchings
- An overview of bilevel optimization
- Blockers and transversals
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Discrete linear bilevel programming problem
- Disjoint (s, t)‐cuts in a network
- Edge-Deletion Problems
- Foundations of bilevel programming
- NP-completeness results for edge modification problems
- Node-Deletion Problems on Bipartite Graphs
- On short paths interdiction problems: Total and node-wise limited interdiction
- On the number of vertices belonging to all maximum stable sets of a graph
- The node-deletion problem for hereditary properties is NP-complete
- The structure and maximum number of maximum independent sets in trees
Cited in
(27)- Blockers for the stability number and the chromatic number
- scientific article; zbMATH DE number 7561685 (Why is no real title available?)
- Minimum \(d\)-transversals of maximum-weight stable sets in trees
- Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions
- Contraction Blockers for Graphs with Forbidden Induced Paths
- Reducing the domination number of graphs via edge contractions and vertex deletions
- Blockers and transversals
- scientific article; zbMATH DE number 6000604 (Why is no real title available?)
- Safety in \(s\)-\(t\) paths, trails and walks
- Blocking total dominating sets via edge contractions
- Reducing graph transversals via edge contractions
- On blockers and transversals of maximum independent sets in co-comparability graphs
- Blocking optimal structures
- Distance-preserving graph compression techniques
- The most vital nodes with respect to independent set and vertex cover
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
- Reducing the vertex cover number via edge contractions
- A survey on mixed-integer programming techniques in bilevel optimization
- Assistance and interdiction problems on interval graphs
- Complexity and algorithms for constant diameter augmentation problems
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Reducing the chromatic number by vertex or edge deletions
- Block transitivity and degree matrices
- Reducing graph transversals via edge contractions
- Critical vertices and edges in \(H\)-free graphs
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
This page was built for publication: Minimum \(d\)-blockers and \(d\)-transversals in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q411244)
