Independent set in categorical products of cographs and splitgraphs
classification
💻 cs.DM
math.CO
keywords
categoricalcographsindependentproductssplitgraphsalgorithmscomputablecompute
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.