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

Alekseev V.E.; Malyshev D.S.

首页> 外文期刊>Journal of applied and industrial mathematics >Planar graph classes with the independent set problem solvable in polynomial time

【24h】

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

机译：Paralar图表类与多项式时间可解决的独立集合问题

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

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

机译：为平面图类的无限家族的亚群而证明了独立组问题的多项式可解性。

著录项

来源
《Journal of applied and industrial mathematics》 |2009年第1期|共4页
作者
Alekseev V.E.; Malyshev D.S.;
展开▼
作者单位

Department of Computational Mathematics and Cybernetics State University of Nizhnii Novgorod pr. Gagarina 23 Nizhnii Novgorod 603950 Russian Federation;

Department of Computational Mathematics and Cybernetics State University of Nizhnii Novgorod pr. Gagarina 23 Nizhnii Novgorod 603950 Russian Federation;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类应用数学;
关键词

相似文献

外文文献
中文文献
专利

1. Planar graph classes with the independent set problem solvable in polynomial time [J] . Alekseev V.E., Malyshev D.S. Journal of applied and industrial mathematics . 2009,第1期

机译：Paralar图表类与多项式时间可解决的独立集合问题
2. Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs [J] . D. S. Malyshev, D. V. Sirotkin Journal of applied and industrial mathematics . 2017,第3期

机译：一类子机平面图中独立集合问题的多项式可解
3. Polynomial-Time Solvability of the Independent Set Problem in a Certain Class of Subcubic Planar Graphs [J] . D. S. Malyshev, D. V. Sirotkin Journal of applied and industrial mathematics . 2017,第3期

机译：一类子机平面图中独立集合问题的多项式可解
4. Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels [C] . Geevarghese Philip, Venkatesh Raman, Somnath Sikdar Annual European Symposium on Algorithms . 2009

机译：在较大类别的图表中解决主导地位：FPT算法和多项式内核
5. Polynomial time recognition and optimization algorithms on special classes of graphs. [D] . Johnson, Julie Lynn. 2003

机译：特殊图类上的多项式时间识别和优化算法。
6. Eulerian Graphs and Polynomial Identities for Sets of Matrices [O] . Joan P. Hutchinson 1974

机译：矩阵集的欧拉图和多项式恒等式
7. Solving dominating set in larger classes of graphs: FPT algorithms and polynomial kernels [O] . Geevarghese Philip, Venkatesh Raman, Somnath Sikdar 2012

机译：在更大类的图中求解控制集：FPT算法和多项式内核
8. Clique Polynomials and Independent Set Polynomials of Graphs [R] . Hoede, C., Xueliang, L. 1991

机译：Clique多项式和图的独立集多项式

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

摘要

著录项

相似文献

相关主题

期刊订阅