Determining the Stability Number of a Graph
From MaRDI portal
Publication:4177607
DOI10.1137/0206046zbMath0395.05047OpenAlexW2149370230MaRDI QIDQ4177607
No author found.
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0206046
Related Items (17)
Determining the number of internal stability of a graph ⋮ An algorithm for the maximum internally stable set in a weighted graph ⋮ Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) ⋮ On comparing algorithms for the maximum clique problem ⋮ Advice complexity of adaptive priority algorithms ⋮ Discrete extremal problems ⋮ Constructing concrete hard instances of the maximum independent set problem ⋮ On the probable behaviour of some algorithms for finding the stability number of a graph ⋮ Minimum node covers and 2-bicritical graphs ⋮ Approximating maximum independent sets by excluding subgraphs ⋮ On the complexity of cutting-plane proofs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ A note on some computationally difficult set covering problems ⋮ A note on the complexity of a partition algorithm ⋮ The maximum number of cliques in dense graphs ⋮ The maximum clique problem ⋮ Two party immediate response disputes: Properties and efficiency
This page was built for publication: Determining the Stability Number of a Graph
