LP-oriented upper bounds for the weighted stability number of a graph
- 22 Downloads
Upper bounds for the weighted stability number of a graph are considered that are based on the approximation of its stable set polytope by linear inequalities for odd cycles and p-wheels in the graph. Algorithms are developed for finding upper bounds on the basis of solution of LP problems with a finite number of inequalities produced by the shortest path algorithm for a special graph. The results of test experiments are given for graphs with several hundred or thousand vertices.
Keywordsweighted stability number of a graph polyhedron of stable sets LP-oriented upper bound t-perfect graph p-wheel Wp-perfect graph
Unable to display preview. Download preview PDF.
- 1.M. Gary and D. Johnson, Computers and Hard-to-Solve Problems [Russian translation], Mir, Moscow (1982).Google Scholar
- 3.R. Wunderling, Paralleler und objektorientierter simplex-algorithmus, Techn. Univ., Berlin (1996), http://www.zib.de/Publications/abstracts/TR-96-09/.zbMATHGoogle Scholar
- 5.DIMACS (1995). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, http://dimacs.rutgers.edu/Challenges/.
- 8.P. I. Stetsyuk and B. M. Chumakov, “Properties of an upper bound of N. Z. Shor for the weighted stability number of a graph,” in: Proc. Intern. Symp. “Computation Optimization Problems (COP-XXXIII), ” V. M. Glushkov Cybernetics Institute of NASU, Kyiv (2007), pp. 271–272.Google Scholar
- 9.I. V. Sergienko and V. P. Shylo, “Problems of discrete optimization: Challenges and main approaches to solve them,” Cybernetics and Systems Analysis, No. 4, 465–482 (2006).Google Scholar