Research article · Sep 2010
Research articlePublished 7 Dec 2018
A sequential and parallel algorithm for disjoint cliques problem on interval graphs
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.
Keywords
Subjects
Mathematics & StatisticsAsk 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.
Similar by topic
Research article · 16 Apr 2025
Ant Target Algorithm: A Novel DNA Target Assembling Technique Using Optimized Graph and Ant Colony Optimization
Opinion · 28 Feb 2023
Advancements in Graph Theory with Algorithms and Applications
Research article · Jan 2014
Computing List of Ordered Pairs from Disjoint Closed Interval to compute a most Probable Delay Path:NPHard in polynomial time
Research article · Aug 2014
A NOVEL GRAPH BASED ALGORITHM FOR ONE DIMENSIONAL BIN PACKING PROBLEM
More from this journal
The newest in Journal of Pure and Applied Mathematics.
Article · 3 Sep 2026
Principles of prime numbers - Part IV - Twin prime andamp; Polignac conjectures andndash; Conservation of gaps
Article · 24 Apr 2025
Advanced solutions to boundary value problems: A comparative study of Rayleigh-Ritz and the finite element method
Article · 24 Apr 2025
Prime generation via polynomials: Analysis and applications
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”

