Abstract
Graph transformations proved useful for many algorithmic problems. In the present paper, we study this tool with respect to the maximum stable set problem. We first review available results on this topic and then propose an approach to uniformly describe and systematically develop graph transformations that do not change the size of a maximum stable set in the graph. The approach is illustrated by a number of new transformations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
