Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs

In: Computing and Informatics, vol. 32, no. 2

M. Talmaciu - E. Nechita - B. Iantovics

Details:

Year, pages: 2013, 313 - 329

Keywords:

Bipartite chain graphs, weakly decomposition, recognition algorithms, combinatorial optimization algorithms

About article:

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.

How to cite:

ISO 690:

Talmaciu, M., Nechita, E., Iantovics, B. 2013. Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs. In Computing and Informatics, vol. 32, no.2, pp. 313-329. 1335-9150.

APA:

Talmaciu, M., Nechita, E., Iantovics, B. (2013). Recognition and Combinatorial Optimization Algorithms for Bipartite Chain Graphs. Computing and Informatics, 32(2), 313-329. 1335-9150.