An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover

DOI10.1006/jagm.2000.1141zbMath0974.68239OpenAlexW2000863020MaRDI QIDQ2729644

Rolf Niedermeier, Henning Fernau

Publication date: 23 July 2001

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.2000.1141

zbMATH Keywords

constraint bipartite vertex cover

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms ⋮ Improved exact algorithms for MAX-SAT ⋮ Unnamed Item ⋮ Worst-Case Analysis of Process Flexibility Designs ⋮ Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations ⋮ Exact exponential-time algorithms for finding bicliques ⋮ 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 ⋮ Heuristics for automated knowledge source integration and service composition ⋮ An Approximation Algorithm Based on Chain Implication for Constrained Minimum Vertex Covers in Bipartite Graphs ⋮ Linear-time algorithm for generating c-isolated bicliques ⋮ Vertex and edge covers with clustering properties: Complexity and algorithms