2000 character limit reached
Independent set in categorical products of cographs and splitgraphs
Published 18 May 2013 in cs.DM and math.CO | (1305.4237v1)
Abstract: We show that there are polynomial-time algorithms to compute maximum independent sets in the categorical products of two cographs and two splitgraphs. We show that the ultimate categorical independence ratio is computable in polynomial time for cographs.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.