Author:
Debnath Chinmay,Daripa Krishna,Mondal Ritu,Datta Alak Kumar
Publisher
Springer Nature Singapore
Reference24 articles.
1. Aho AV, Hopcroft JE (1974) The design and analysis of computer algorithms. Pearson Education India
2. Boaz B-M, Binay B, Qiaosheng S, Arie T (2007) Efficient algorithms for center problems in cactus networks. Theor Comput Sci 378(3):237–252
3. Cormen TH, Leiserson CE, Rivest RL, Stein C (2010) Introduction to algorithms. PHI Learning Pvt. Ltd., Originally MIT Press
4. Kalyani D, Madhumangal P (2008) An optimal algorithm to find maximum and minimum height spanning trees on cactus graphs. Adv Model Optim 10(1):121–134
5. Datta AK (2015) Approximate spanning cactus. Inform Process Lett 115(11):828–832
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Spanning Cactus Existence Problem on Flower Snark Graphs;Communications in Computer and Information Science;2023-11-30