ǂA ǂpolynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
Abstract
A polynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
Keywords
neodvisna množica;povečujoč graf;polinomski algoritem;independent set;augmenting graph;polynomial-time algorithm;
Data
| Language: | English |
|---|---|
| Year of publishing: | 2019 |
| Typology: | 1.08 - Published Scientific Conference Contribution |
| Organization: | UP - University of Primorska |
| UDC: | 519.17:004 |
| COBISS: |
1541565380
|
| ISSN: | 0302-9743 |
| Views: | 1386 |
| Downloads: | 115 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
Other data
| Secondary language: | English |
|---|---|
| Secondary keywords: | neodvisna množica;povečujoč graf;polinomski algoritem; |
| Pages: | Str. 271-284 |
| DOI: | 10.1007/978-3-030-30786-8_21 |
| ID: | 11800577 |
Recommended works:
ǂA ǂpolynomial-time algorithm for the independent set problem in {P_{10}, C_4, C_6}-free graphs
2019,
no subtitle data available
Bipartite graphs of small readability
2020,
no subtitle data available
Bipartite graphs of small readability
2018,
no subtitle data available
Vertex cover at distance on H-free graphs
2021,
no subtitle data available
On hereditary efficiently dominatable graphs
2011,
Exploiting graph structure to cope with hard problems, Dagsthul seminar 11182, 01.05.11-06.05.11