Hello, I am Chongsong, from Nanyang Technological University, Singapore. Currently, i am in year one of Computer Science. I wonder that for modular decomposition project, is what is the restriction/ limit of its algorithm's time complexity? Is O(n^5) or O(n^4) OK?
-- You received this message because you are subscribed to the Google Groups "sage-gsoc" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-gsoc. For more options, visit https://groups.google.com/d/optout.
