Author:
Orlovich Yury,Dolgui Alexandre,Finke Gerd,Gordon Valery,Werner Frank
Funder
Belarus BRFFR
French CNRS
DAAD
Ministry of Education of the Republic of Belarus
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference67 articles.
1. V.E. Alekseev, On the number of maximal stable sets in graphs from hereditary classes, in: Combinatorial-Algebraic Methods in Discrete Optimization, Gor’kov. Gos. University, Gorky, 1991, pp. 5–8 (in Russian).
2. Polynomial algorithm for finding the largest independent sets in graphs without forks;Alekseev;Discrete Appl. Math.,2004
3. Complexity and Approximation;Ausiello,1999
4. Reductions, completeness and the hardness of approximability;Ausiello;Eur. J. Oper. Res.,2006
5. On graphs with polynomially solvable maximum-weight clique problem;Balas;Networks,1989
Cited by
49 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献