Constraint bipartite vertex cover: simpler exact algorithms and implementations

DOI10.1007/S10878-010-9289-7MaRDI QIDQ431922zbMATH OpenOpenAlexFDO

Authors Guo Qiang Bai, Henning Fernau

Publication date 3 July 2012

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-010-9289-7

zbMATH Keywords

constraint bipartite vertex coverimplementation and tests of exact algorithmsparameterized algorithmsspare allocation problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
• Publication:4941917
• scientific article; zbMATH DE number 175738
• An efficient exact algorithm for constraint bipartite vertex cover
• scientific article; zbMATH DE number 2044921

Cites work

• A new bound on the feedback vertex sets in cubic graphs
• A new class of efficient algorithms for reconfiguration of memory arrays
• An efficient exact algorithm for constraint bipartite vertex cover
• An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
• Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
• Dealing with large hidden constants, engineering a planar Steiner tree PTAS
• Estimating the Efficiency of Backtrack Programs
• scientific article; zbMATH DE number 3887060 (Why is no real title available?)
• scientific article; zbMATH DE number 2090012 (Why is no real title available?)
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Searching Trees: An Essay
• SOFSEM 2005: Theory and Practice of Computer Science
• Tree Size by Partial Backtracking

Cited in

(5)

• An efficient exact algorithm for constraint bipartite vertex cover
• Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
• 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

This page was built for publication: Constraint bipartite vertex cover: simpler exact algorithms and implementations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431922)