A polynomial time solvable instance of the feasible minimum cover problem

DOI10.1016/S0020-0190(98)00154-9zbMath1337.05101MaRDI QIDQ293433

Chor-Ping Low

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001549?np=y

zbMATH Keywords

bipartite graphpolynomial time algorithmmaximum matchingvertex cover

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• The uniquely solvable bipartite matching problem
• TWO THEOREMS IN GRAPH THEORY
• Coverings of Bipartite Graphs
• A new class of efficient algorithms for reconfiguration of memory arrays
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs