Maximum weight independent sets in (\(P_6\), co-banner)-free graphs

DOI10.1016/j.ipl.2012.10.004zbMath1259.68096OpenAlexW116738217MaRDI QIDQ1943621

Raffaele Mosca

Publication date: 20 March 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2012.10.004

zbMATH Keywords

graph algorithmspolynomial algorithmsmaximum weight independent set problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Weighted independent sets in classes of \(P_6\)-free graphs ⋮ The Maximum Weight Stable Set Problem in ( $$P_6$$ , bull)-Free Graphs ⋮ A sufficient condition to extend polynomial results for the maximum independent set problem ⋮ New results on independent sets in extensions of \(2K_2\)-free graphs ⋮ Maximum weight independent sets for (\(P_7\),triangle)-free graphs in polynomial time ⋮ Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs ⋮ Independent Sets in Classes Related to Chair-Free Graphs

This page was built for publication: Maximum weight independent sets in (\(P_6\), co-banner)-free graphs