Minimum d-blockers and d-transversals in graphs
From MaRDI portal
Publication:411244
DOI10.1007/S10878-010-9334-6zbMATH Open1263.90110OpenAlexW2086790666MaRDI QIDQ411244FDOQ411244
Authors: Marie-Christine Costa, Dominique De Werra, Christophe Picouleau 
Publication date: 4 April 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9334-6
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
- Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
bilevel programmingbipartite graphsplit graphtransversalblockerstable setcover\(s\)-\(t\) cut\(s\)-\(t\) path
Cites Work
- Title not available (Why is that?)
- Foundations of bilevel programming
- An overview of bilevel optimization
- Blockers and transversals
- The node-deletion problem for hereditary properties is NP-complete
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Node-Deletion Problems on Bipartite Graphs
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- On short paths interdiction problems: Total and node-wise limited interdiction
- Discrete linear bilevel programming problem
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- NP-completeness results for edge modification problems
- The structure and maximum number of maximum independent sets in trees
- A constructive characterization of trees with at least k disjoint maximum matchings
- On the number of vertices belonging to all maximum stable sets of a graph
- Edge-Deletion Problems
- Disjoint (s, t)‐cuts in a network
- Title not available (Why is that?)
Cited In (27)
- Title not available (Why is that?)
- Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions
- \(d\)-transversals of stable sets and vertex covers in weighted bipartite graphs
- Safety in \(s\)-\(t\) paths, trails and walks
- On blockers and transversals of maximum independent sets in co-comparability graphs
- Critical vertices and edges in \(H\)-free graphs
- Blockers and transversals
- Reducing the vertex cover number via edge contractions
- Title not available (Why is that?)
- Reducing the chromatic number by vertex or edge deletions
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
- Block transitivity and degree matrices
- Contraction Blockers for Graphs with Forbidden Induced Paths
- Blocking total dominating sets via edge contractions
- Reducing graph transversals via edge contractions
- Distance-preserving graph compression techniques
- The most vital nodes with respect to independent set and vertex cover
- Blockers for the stability number and the chromatic number
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs
- Reducing the domination number of graphs via edge contractions and vertex deletions
- Title not available (Why is that?)
- Assistance and interdiction problems on interval graphs
- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- A survey on mixed-integer programming techniques in bilevel optimization
- Blocking optimal structures
- Minimum \(d\)-transversals of maximum-weight stable sets in trees
- Complexity and algorithms for constant diameter augmentation problems
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)
