2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DS2012★ 2 cited
A combinatorial algorithm to generate all spanning trees of a weighted graph in order of increasing cost
Barun Biswas, Krishnendu Basuli, Saptarshi Naskar +2
The most popular algorithms for generation of minimal spanning tree are Kruskal and Prim algorithm. Many algorithms have been proposed for generation of all spanning tree. This pap…
cs.DS2012
On an optimization technique using Binary Decision Diagram
Debajit Sensarma, Subhashis Banerjee, Krishnendu Basuli +2
Two-level logic minimization is a central problem in logic synthesis, and has applications in reliability analysis and automated reasoning. This paper represents a method of minimi…