An efficient exact algorithm for constraint bipartite vertex cover
From MaRDI portal
Recommendations
- Publication:4941917
- An improved fixed-parameter algorithm for vertex cover
- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
- Constraint bipartite vertex cover: simpler exact algorithms and implementations
- An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem
Cited in
(15)- Vertex and edge covers with clustering properties: Complexity and algorithms
- Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
- Improved exact algorithms for MAX-SAT
- Exact exponential-time algorithms for finding bicliques
- Worst-case analysis of process flexibility designs
- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
- An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem
- Constraint bipartite vertex cover: simpler exact algorithms and implementations
- An exact exponential time algorithm for counting bipartite cliques
- Charge and reduce: A fixed-parameter algorithm for string-to-string correction
- Problems and invariants connected with bicliques and multicliques of graphs
- scientific article; zbMATH DE number 1418354 (Why is no real title available?)
- Linear-time algorithm for generating c-isolated bicliques
- An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
- Heuristics for automated knowledge source integration and service composition
This page was built for publication: An efficient exact algorithm for constraint bipartite vertex cover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2729644)
