Advances in Intelligent Systems and Computing

2017

DOI: 10.1007/978-981-10-3409-1_2

|View full text |Cite

|

Sign up to set email alerts

|

A Divide-and-Conquer Algorithm for All Spanning Tree Generation

Maumita Chakraborty

¹

,

²

,

Rajat Kumar Pal

³

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Theorem 4 ([8]1

Citation Types

Supporting

0

Mentioning

1

Contrasting

0

Year Published

2018

2018

2021

2021

Publication Types

Select...

Other1

Book1

Article1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(1 citation statement)

References 16 publications

Supporting

0

Mentioning

1

Contrasting

0

Order By: Relevance

“…Here N refers to the number of spanning trees of a graph having V vertices and E edges. Recently, some improved versions have been presented in [6,7], respectively. For example, the algorithm [6] takes O(N V + V 3 ) time and O(V 2 ) space for enumerating all the spanning trees.…”

Section: Theorem 4 ([8]mentioning

confidence: 99%

A note on Graphical Notation Reveals Topological Stability Criteria for Collective Dynamics in Complex Network

He¹,

Li²,

et al. 2018

Preprint

View full text Add to dashboard Cite

This paper clarifies the main research methods and ideas of the thesis [1,2,4]. The special calculation process is also realized by corresponding computer algorithm. Finally, we introduce zero rows sum case and give the corresponding algorithm, which greatly simplifies the relevant calculation of paper [1,4].

“…Here N refers to the number of spanning trees of a graph having V vertices and E edges. Recently, some improved versions have been presented in [6,7], respectively. For example, the algorithm [6] takes O(N V + V 3 ) time and O(V 2 ) space for enumerating all the spanning trees.…”

Section: Theorem 4 ([8]mentioning

confidence: 99%

A note on Graphical Notation Reveals Topological Stability Criteria for Collective Dynamics in Complex Network

He¹,

Li²,

et al. 2018

Preprint

View full text Add to dashboard Cite

This paper clarifies the main research methods and ideas of the thesis [1,2,4]. The special calculation process is also realized by corresponding computer algorithm. Finally, we introduce zero rows sum case and give the corresponding algorithm, which greatly simplifies the relevant calculation of paper [1,4].

Algorithm to Generate All Spanning Tree Structures of a Complete Graph

¹

,

³

et al. 2021

Lecture Notes on Data Engineering and Communications Technologies

View full text Add to dashboard Cite

No abstract

Automatic computing of the grand potential in finite temperature many-body perturbation theory

¹

,

²

2019

Int. J. Mod. Phys. C

View full text Add to dashboard Cite

A new program created in C/C[Formula: see text] language generates automatically the analytic expression of grand potential and prints it in Latex2e format and in textual data. Another code created in Mathematica language can translate the textual data into a mathematical expression and help any interested to evaluate the thermodynamic quantities in analytic or numeric forms.

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

Product

Browser Extension Assistant by scite Citation Statement Search Reference Check Visualizations Dashboards Explore Journals Explore Organizations Explore Funders Embedding Badge Embedding Citation Search Pricing

Resources

Blog Help & FAQ Accessibility Statement API Terms For Universities & Governments For Researchers For Publishers For Corporate, Pharma & Enterprise Author Marketing Become an Affiliate Get an organization trial or quote scite Data & Services

About

News & Press Careers Read our Paper Coverage

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Copyright © 2025 scite LLC. All rights reserved.

Made with 💙 for researchers

Part of the Research Solutions Family.