Constraint bipartite vertex cover: simpler exact algorithms and implementations

DOI10.1007/S10878-010-9289-7zbMath1245.90095OpenAlexW2034793302MaRDI QIDQ431922

Guoqiang 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

parameterized algorithmsconstraint bipartite vertex coverimplementation and tests of exact algorithmsspare allocation problem

Mathematics Subject Classification ID

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

Related Items (1)

Linear-time algorithm for generating c-isolated bicliques

Cites Work

• Unnamed Item
• Unnamed Item
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
• A new bound on the feedback vertex sets in cubic graphs
• An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
• Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations
• An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem
• Searching Trees: An Essay
• On feedback vertex sets and nonseparating independent sets in cubic graphs
• Estimating the Efficiency of Backtrack Programs
• Tree Size by Partial Backtracking
• A new class of efficient algorithms for reconfiguration of memory arrays
• Dealing with large hidden constants
• SOFSEM 2005: Theory and Practice of Computer Science

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