%0 Conference Paper %1 conf/cocoa/DingX10 %A Ding, Wei %A Xue, Guoliang %B COCOA (2) %D 2010 %E Wu, Weili %E Daescu, Ovidiu %I Springer %K dblp %P 268-280 %T A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree. %U http://dblp.uni-trier.de/db/conf/cocoa/cocoa2010-2.html#DingX10 %V 6509 %@ 978-3-642-17460-5

@inproceedings{conf/cocoa/DingX10, added-at = {2019-06-02T00:00:00.000+0200}, author = {Ding, Wei and Xue, Guoliang}, biburl = {https://www.bibsonomy.org/bibtex/26ceb1ad288304b3bf1e56589f6287b82/dblp}, booktitle = {COCOA (2)}, crossref = {conf/cocoa/2010-2}, editor = {Wu, Weili and Daescu, Ovidiu}, ee = {https://www.wikidata.org/entity/Q62043111}, interhash = {580bac4ab4dcec66ed6974f4c49a4359}, intrahash = {6ceb1ad288304b3bf1e56589f6287b82}, isbn = {978-3-642-17460-5}, keywords = {dblp}, pages = {268-280}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-09T23:31:15.000+0200}, title = {A Divide-and-Conquer Algorithm for Computing a Most Reliable Source on an Unreliable Ring-Embedded Tree.}, url = {http://dblp.uni-trier.de/db/conf/cocoa/cocoa2010-2.html#DingX10}, volume = 6509, year = 2010 }