Sign In

Login

Password

Forgot Password ? Sign Up

Minimum degree spanning tree (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Minimum degree spanning tree" in English language version.

refsWebsite
Global rank English rank
3doi.org
2nd place
2nd place
1springer.com
274th place
309th place
1semanticscholar.org
11th place
8th place

doi.org (Global: 2nd place; English: 2nd place)

  • Krishnan, Radha; Raghavachari, Balaji (2001). "The Directed Minimum-Degree Spanning Tree Problem". FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 2245. pp. 232–243. doi:10.1007/3-540-45294-X_20. ISBN 978-3-540-43002-5.
  • Haque, Mohammed Atiqul; Uddin, Md. Reaz; Kashem, Md. Abul (2007). "An Algorithm for Finding Minimum Degree Spanning Tree of Series-Parallel Graphs". 2007 International Conference on Information and Communication Technology. pp. 27–31. doi:10.1109/ICICT.2007.375336. ISBN 978-984-32-3394-3. S2CID 17947444.
  • Yao, Guohui; Zhu, Daming; Li, Hengwu; Ma, Shaohan (6 September 2008). "A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem". Discrete Mathematics. 308 (17): 3951–3959. doi:10.1016/j.disc.2007.07.105.

semanticscholar.org (Global: 11th place; English: 8th place)

api.semanticscholar.org

  • Haque, Mohammed Atiqul; Uddin, Md. Reaz; Kashem, Md. Abul (2007). "An Algorithm for Finding Minimum Degree Spanning Tree of Series-Parallel Graphs". 2007 International Conference on Information and Communication Technology. pp. 27–31. doi:10.1109/ICICT.2007.375336. ISBN 978-984-32-3394-3. S2CID 17947444.

springer.com (Global: 274th place; English: 309th place)

link.springer.com

  • Krishnan, Radha; Raghavachari, Balaji (2001). "The Directed Minimum-Degree Spanning Tree Problem". FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science. Vol. 2245. pp. 232–243. doi:10.1007/3-540-45294-X_20. ISBN 978-3-540-43002-5.