Abstract
Two algorithms are considered that find the largest set of pairwise incomparable weighted vertices. The branch-and-bound method is used to find the set subject to additional constraints. Results of a computational experiment are reported.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
L. E. Kornilova and Yu. V. Voitishin, "Some properties of antichains of partially ordered sets," Kibernetika, No. 5, 90–91 (1978).
Yu. V. Voitishin, "Minimum flow problem and algorithms for its solution," Kibernetika, No. 1, 116–118 (1980).
Yu. V. Voitishin, Network Approach to the Solution of the Set Partitioning Problem [in Russian], Preprint 86-13, Inst. Kiber. im. V. M. Glushkova Akad. Nauk UkrSSR, Kiev (1986).
Yu. V. Voitishin and E. A. Sharkovskaya, "Experimental comparison of methods for reduction of the set partitioning problem to network models," in: Applied Program Packages and Numerical Methods [in Russian], Inst. Kiber. im. V. M. Glushkova Akad. Nauk UkrSSR, Kiev (1988), pp. 56–61.
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 5–11, July–August, 1991.
Rights and permissions
About this article
Cite this article
Voitishin, Y.V. Algorithms to find the maximum set of pairwise incomparable weighted vertices in a directed acyclic graph. Cybern Syst Anal 27, 475–480 (1991). https://doi.org/10.1007/BF01130355
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01130355