A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges

Wei Ding, Guoliang Xue. A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges. In Weifan Wang, Xuding Zhu, Ding-Zhu Du, editors, Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings. Volume 6831 of Lecture Notes in Computer Science, pages 98-112, Springer, 2011. [doi]

@inproceedings{DingX11-0,
  title = {A Fast Parallel Algorithm for Finding a Most Reliable Source on a General Ring-Tree Graph with Unreliable Edges},
  author = {Wei Ding and Guoliang Xue},
  year = {2011},
  doi = {10.1007/978-3-642-22616-8_9},
  url = {http://dx.doi.org/10.1007/978-3-642-22616-8_9},
  tags = {source-to-source, graph-rewriting, rewriting, open-source},
  researchr = {https://researchr.org/publication/DingX11-0},
  cites = {0},
  citedby = {0},
  pages = {98-112},
  booktitle = {Combinatorial Optimization and Applications - 5th International Conference, COCOA 2011, Zhangjiajie, China, August 4-6, 2011. Proceedings},
  editor = {Weifan Wang and Xuding Zhu and Ding-Zhu Du},
  volume = {6831},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-22615-1},
}