A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
From MaRDI portal
Publication:5901120
DOI10.1145/1109557.1109561zbMath1192.05165OpenAlexW4232451777MaRDI QIDQ5901120
Vadim V. Lozin, Martin Milanič
Publication date: 16 August 2010
Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1109557.1109561
Related Items (6)
A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs ⋮ Computing well-covered vector spaces of graphs using modular decomposition ⋮ Independent sets in graphs ⋮ Maximum independent sets in subclasses of \(P_{5}\)-free graphs ⋮ The Maximum Independent Set Problem in Planar Graphs ⋮ Counting Weighted Independent Sets beyond the Permanent
This page was built for publication: A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
