Maumita Chakraborty

According to our database, Maumita Chakraborty authored at least 5 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2024

Generation of all rooted trees up to a given height.

Sumit Chakraborty, Maumita Chakraborty, Rajat Kumar Pal

Innov. Syst. Softw. Eng., September, 2024

2022

Divide-and-conquer based all spanning tree generation algorithm of a simple connected graph.

Maumita Chakraborty, Ranjan Mehera, Rajat Kumar Pal

Theor. Comput. Sci., 2022

2019

Generation of Simple, Connected, Non-isomorphic Random Graphs.

Maumita Chakraborty, Sumon Chowdhury, Rajat Kumar Pal

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.

Maumita Chakraborty, Sumon Chowdhury, Rajat Kumar Pal

IEEE Access, 2018

2016

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

Maumita Chakraborty, Ranjan Mehera, Rajat Kumar Pal

Proceedings of the Advanced Computing and Systems for Security, 2016