scientific article; zbMATH DE number 4068924

zbMATH Open0655.05051MaRDI QIDQ3801591FDOQ3801591

Authors: Dawei Hong 

Publication date: 1987

Title of this publication is not available (Why is that?)

Recommendations

• Minimum covering algorithm on bipartite graph
• scientific article; zbMATH DE number 175738
• scientific article; zbMATH DE number 1104328
• scientific article; zbMATH DE number 3910436
• Finding all minimum-cost perfect matchings in Bipartite graphs

zbMATH Keywords

algorithmall minimal coverings in bipartite graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Methods of finding all minimum coverings of a graph by cliques
• A tabu thresholding algorithm for arc crossing minimization in bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimum covering algorithm on bipartite graph

This page was built for publication:

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