• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта

Статья

Planar graph classes with the independent set problem solvable in polynomial time

Journal of Applied and Industrial Mathematics. 2008. Vol. 3. No. 1. P. 1-5.
Malyshev D., Alekseev V.

The polynomial solvability of the independent set problem is proved for an infinite family of subsets of the class of planar graphs.