Polynomial-time solvability of the independent set problem in a certain class of subcubic planar graphs
| Autor: | D. V. Sirotkin, Dmitriy S. Malyshev |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Discrete mathematics
Polynomial Applied Mathematics 0102 computer and information sciences 02 engineering and technology 01 natural sciences Tree (graph theory) Industrial and Manufacturing Engineering Planar graph Combinatorics symbols.namesake 020303 mechanical engineering & transports 0203 mechanical engineering 010201 computation theory & mathematics Dominating set Independent set symbols Maximal independent set Split graph Time complexity Mathematics |
| Zdroj: | Journal of Applied and Industrial Mathematics. 11:400-414 |
| ISSN: | 1990-4797 1990-4789 |
| Popis: | The independent set problem for a given simple graph consists in computing the size of a largest subset of its pairwise nonadjacent vertices. In this article, we prove the polynomial solvability of the problem for the subcubic planar graphs with no induced tree obtained by identifying the ends of three paths of lengths 3, 3, and 2 respectively. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink