Finding Independent Spanning Trees in Partial k-Trees

Xiao Zhou, Takao Nishizeki. Finding Independent Spanning Trees in Partial k-Trees. In D. T. Lee, Shang-Hua Teng, editors, Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings. Volume 1969 of Lecture Notes in Computer Science, pages 168-179, Springer, 2000. [doi]

@inproceedings{ZhouN00:0,
  title = {Finding Independent Spanning Trees in Partial k-Trees},
  author = {Xiao Zhou and Takao Nishizeki},
  year = {2000},
  url = {http://link.springer.de/link/service/series/0558/bibs/1969/19690168.htm},
  researchr = {https://researchr.org/publication/ZhouN00%3A0},
  cites = {0},
  citedby = {0},
  pages = {168-179},
  booktitle = {Algorithms and Computation, 11th International Conference, ISAAC 2000, Taipei, Taiwan, December 18-20, 2000, Proceedings},
  editor = {D. T. Lee and Shang-Hua Teng},
  volume = {1969},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-41255-7},
}