Skynets: searching for minimum trees in graphs with incomparable edge weights.
Huiping Cao|K. Selçuk Candan|Maria Luisa Sapino
| Anthology ID: | DBLP:conf/cikm/CaoCS11 |
|---|---|
| Volume: | Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011 |
| Year: | 2011 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 1775-1784 |
| URL: | https://doi.org/10.1145/2063576.2063833 |
| DOI: | https://doi.org/10.1145/2063576.2063833 |
| DBLP: | conf/cikm/CaoCS11 |
| BibTeX: |
@inproceedings{cao-2011-skynets,
author = {Huiping Cao and
K. Sel\c{c}uk Candan and
Maria Luisa Sapino},
editor = {Craig Macdonald and
Iadh Ounis and
Ian Ruthven},
title = {{Skynets: searching for minimum trees in graphs with incomparable edge weights}},
booktitle = {{Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011}},
pages = {1775--1784},
publisher = {ACM},
year = {2011},
url = {https://doi.org/10.1145/2063576.2063833},
doi = {https://doi.org/10.1145/2063576.2063833}
}