文章基本信息

标题：Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs
其他标题：Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs
作者：Talmaciu, Mihai ; Nechita, Elena ; Iantovics, Barna 等
期刊名称：COMPUTING AND INFORMATICS
印刷版ISSN：1335-9150
出版年度：2013
卷号：32
期号：2
页码：313-329
语种：English
出版社：COMPUTING AND INFORMATICS
摘要：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.
关键词：Bipartite chain graphs; weakly decomposition; recognition algorithms; combinatorial optimization algorithms