scientific article; zbMATH DE number 6000604
From MaRDI portal
Publication:3109939
Recommendations
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- Some graph optimization problems with weights satisfying linear constraints
- Some graph optimization problems with weights satisfying linear constraints
- A characterization of partial blocks in weighted graphs
- Weighted maximum-clique transversal sets of graphs
- Reoptimization of Weighted Graph and Covering Problems
- Maximum \(k\)-covering of weighted transitive graphs with applications
- A linear-time algorithm for weighted paired-domination on block graphs
- On transit functions in weighted graphs
- SOFSEM 2005: Theory and Practice of Computer Science
Cited in
(9)- Blockers and transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid
- Blocking total dominating sets via edge contractions
- Complexity and algorithms for constant diameter augmentation problems
- Reducing the domination number of graphs via edge contractions and vertex deletions
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions
- Blocking independent sets for \(H\)-free graphs via edge contractions and vertex deletions
- Blocking, efficiency and weighted optimality
- Minimum \(d\)-blockers and \(d\)-transversals in graphs
- Reducing the domination number of graphs via edge contractions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3109939)
