Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations

DOI10.1007/978-3-540-69311-6_10zbMath1143.68500OpenAlexW1579321601MaRDI QIDQ3507320

Henning Fernau, Guoqiang Bai

Publication date: 19 June 2008

Published in: Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69311-6_10

Mathematics Subject Classification ID

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

Related Items (3)

Worst-Case Analysis of Process Flexibility Designs ⋮ Exact exponential-time algorithms for finding bicliques ⋮ Constraint bipartite vertex cover: simpler exact algorithms and implementations

Cites Work

• Unnamed Item
• Unnamed Item
• Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
• An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
• An Exact Algorithm Based on Chain Implication for the Min-CVCB Problem
• Increased throughput for the testing and repair of RAMs with redundancy

This page was built for publication: Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations