Scholars Central

Research articlePublished 7 Dec 2018

A sequential and parallel algorithm for disjoint cliques problem on interval graphs

Authors: Sukumar Mondal

Journal of Pure and Applied Mathematics

Volume 2 · Issue 3 · Pages 5–8

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

Using DAG approach,A sequential algorithm is presented to solve disjoint cliques problem on interval graph G which takes O(n^2) time where n is the number of vertices of the graph. For the same problem a O(log2n) time parallel algorithm is presented which takes processors on an EREW PRAM model. Also, on a CREW model it takes O(logn) time with O(n^(3+ε) ),ε>0 processors.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Pure and Applied Mathematics.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Pure and Applied Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Sukumar Mondal”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels