An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem
From MaRDI portal
Recommendations
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
- Publication:4941917
- Polynomially solvable cases of the minimum biclique vertex-cover problem
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- An efficient exact algorithm for constraint bipartite vertex cover
Cited in
(5)- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- An efficient exact algorithm for constraint bipartite vertex cover
- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
- Constraint bipartite vertex cover: simpler exact algorithms and implementations
- scientific article; zbMATH DE number 1418354 (Why is no real title available?)
This page was built for publication: An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611988)