A two-stages tree-searching algorithm for finding three completely independent spanning trees

Kung-Jui Pai, Ruay Shiung Chang, Ro-Yu Wu, Jou-Ming Chang. A two-stages tree-searching algorithm for finding three completely independent spanning trees. Theoretical Computer Science, 784:65-74, 2019. [doi]

@article{PaiCWC19,
  title = {A two-stages tree-searching algorithm for finding three completely independent spanning trees},
  author = {Kung-Jui Pai and Ruay Shiung Chang and Ro-Yu Wu and Jou-Ming Chang},
  year = {2019},
  doi = {10.1016/j.tcs.2019.03.035},
  url = {https://doi.org/10.1016/j.tcs.2019.03.035},
  researchr = {https://researchr.org/publication/PaiCWC19},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {784},
  pages = {65-74},
}