Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

Hoda Akbari, Zeinab Iranmanesh, Mohammad Ghodsi. Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs. In 13th International Conference on Parallel and Distributed Systems (ICPADS 2007), December 5-7, 2007, Hsinchu, Taiwan. pages 1-8, IEEE Computer Society, 2007. [doi]

@inproceedings{AkbariIG07,
  title = {Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs},
  author = {Hoda Akbari and Zeinab Iranmanesh and Mohammad Ghodsi},
  year = {2007},
  doi = {10.1109/ICPADS.2007.4447726},
  url = {http://doi.ieeecomputersociety.org/10.1109/ICPADS.2007.4447726},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/AkbariIG07},
  cites = {0},
  citedby = {0},
  pages = {1-8},
  booktitle = {13th International Conference on Parallel and Distributed Systems (ICPADS 2007), December 5-7, 2007, Hsinchu, Taiwan},
  publisher = {IEEE Computer Society},
}