Perspective · 30 Apr 2026
Research articlePublished Nov 2010
GENERATION OF ALL SPANNING TREES A COMBINATORIAL APPROACH
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
This paper deals with all spanning tree generation of a simple, symmetric and connected graph. Since, number of spanning trees of a graph is asymptotically exponential it is our endeavor to generate, all trees in reasonable amount of time and space[1]. The method here is qualitatively and quantitatively better than existing methods. The reason behind the claim is minimum number of duplicate tree comparison and no circuit testing at all for its realization[1,6-11]. We are hopeful that betterment of the algorithm lies in the target of no duplicate tree generation.
Subjects
Computer Science & ITAsk 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.
More from this journal
The newest in Journal of Global Research in Computer Sciences.
Research article · 17 Dec 2025
Computer Vision-Based Monitoring Method of Non-Wearing Helmet Events Using Face Recognition
Short communication · 17 Dec 2025
Leveraging AI in SAP Analytics Cloud for Business Transformation
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalJournal of Global Research in Computer Sciences
- SubjectComputer Science & IT
- BylineArticles whose byline prints “Saptarshi Naskar”
- BylineArticles whose byline prints “Krishnendu Basuli”
- BylineArticles whose byline prints “Samar Sen Sarma”
