Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs
Keywords:Bipartite chain graphs, weakly decomposition, recognition algorithms, combinatorial optimization algorithms
AbstractIn 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.
Download data is not yet available.
How to Cite
Talmaciu, M., Nechita, E., & Iantovics, B. (2013). Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs. COMPUTING AND INFORMATICS, 32(2), 313–329. Retrieved from http://www.cai.sk/ojs/index.php/cai/article/view/1623