RECOGNITION AND COMBINATORIAL OPTIMIZATION ALGORITHMS FOR BIPARTITE CHAIN GRAPHS

摘要

In this paper we give a recognition algorithm in O(n(n + m)) time for bipartite chain graphs, and directly calculate the density of such graphs. For their stability number and domination number, we give algorithms comparable to the existing ones. We point out some applications of bipartite chain graphs in chemistry and approach the Minimum Chain Completion problem.