An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem

DOI10.1007/978-3-540-73556-4_36MaRDI QIDQ3611988zbMATH OpenOpenAlexFDO

Authors Jianxin Wang, Xiaoshuang Xu, Yunlong Liu

Publication date 3 March 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73556-4_36

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs
• An efficient exact algorithm for constraint bipartite vertex cover
• 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
• An efficient exact algorithm for constraint bipartite vertex cover

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)