Abstract
In this paper, we analyze the intersection graphs of subtrees in a cactus, called cactus subtree graphs. A max-k-clique subgraph of a graph is an induced subgraph whose maximum clique has at most [Formula: see text] vertices. We describe a polynomial time algorithm to find a maximum weight max-[Formula: see text]-clique subgraph in a cactus subtree graph when [Formula: see text] is fixed. In perfect graphs this problem is equivalent to the maximum weight [Formula: see text]-colorable subgraph problem. In many applications like scheduling production lines and communication networks on imperfect graphs, a maximum max-[Formula: see text]-clique subgraph solution is better than a maximum [Formula: see text]-colorable subgraph solution. In addition, we describe cactus subtree graphs polynomial time algorithms for recognition, maximum independent sets, maximum cliques, maximum induced bipartite graphs, maximum induced forests and minimum feedback vertex sets.
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.
