Maumita Chakraborty

Orcid: 0000-0002-3376-7158

According to our database1, Maumita Chakraborty authored at least 4 papers between 2016 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph.
Theor. Comput. Sci., 2022

2019
Generation of Simple, Connected, Non-isomorphic Random Graphs.
Proceedings of the Advanced Computing and Systems for Security, 2019

2018
Two Algorithms for Computing All Spanning Trees of a Simple, Undirected, and Connected Graph: Once Assuming a Complete Graph.
IEEE Access, 2018

2016
A Divide-and-Conquer Algorithm for All Spanning Tree Generation.
Proceedings of the Advanced Computing and Systems for Security, 2016


  Loading...