A polynomial-time algorithm for the Independent Set problem in \P₁₀,C₄,C₆\-free graphs

DOI10.1007/978-3-030-30786-8_21MaRDI QIDQ2301550zbMATH OpenOpenAlexFDO

Authors Edin Husić, Martin Milanič

Publication date 24 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-30786-8_21

zbMATH Keywords

independent setpolynomial-time algorithmaugmenting graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Independent set in \(P_5\)-free graphs in polynomial time
• Some results on graphs without long induced paths
• New cases of the polynomial solvability of the independent set problem for graphs with forbidden paths
• A subexponential-time algorithm for the maximum independent set problem in \(P_t\)-free graphs
• Polynomial-time algorithm for maximum weight independent set on \(P_6\)-free graphs

Cited in

(2)

• A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
• scientific article; zbMATH DE number 7650229 (Why is no real title available?)

This page was built for publication: A polynomial-time algorithm for the Independent Set problem in \(\{{P_{10}},C_4,C_6\}\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301550)