scientific article; zbMATH DE number 3987328

MaRDI QIDQ3751618zbMATH OpenFDO

Authors S. N. Trushin, V. K. Yantsevich

Publication date 1985

zbMATH Keywords

approximation algorithmcomputational experimentsexact algorithmsindependent setlargest internally stable set

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• An exact algorithm for the maximum stable set problem
• Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph
• A self-stabilizing algorithm for optimally efficient sets in graphs
• The struction algorithm for the maximum stable set problem revisited
• STABULUS: A technique for finding stable sets in large graphs with tabu search
• Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
• Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs
• A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs
• Experimental and Efficient Algorithms
• Computing maximum stable sets for distance-hereditary graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3751618)