scientific article
From MaRDI portal
Publication:3751618
zbMATH Open0611.05050MaRDI QIDQ3751618
S. N. Trushin, V. K. Yantsevich
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational experimentsapproximation algorithmindependent setexact algorithmslargest internally stable set
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
- A self-stabilizing algorithm for optimally efficient sets in graphs 👍 👎
- STABULUS: A technique for finding stable sets in large graphs with tabu search 👍 👎
- An exact algorithm for the maximum stable set problem 👍 👎
- The struction algorithm for the maximum stable set problem revisited 👍 👎
- Experimental comparison of algorithms for the problem of the maximum set of pairwise incomparable vertices in a digraph 👍 👎
- Efficient self-stabilizing algorithms for minimal total \(k\)-dominating sets in graphs 👍 👎
- Computing maximum stable sets for distance-hereditary graphs 👍 👎
- A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs 👍 👎
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming 👍 👎
- Experimental and Efficient Algorithms 👍 👎
This page was built for publication:
