Khanna, Sanjeev, and Konrad, Christian. Optimal Bounds for Dominating Set in Graph Streams. Retrieved from https://par.nsf.gov/biblio/10329638. Leibniz international proceedings in informatics 215. Web. doi:10.4230/LIPIcs.ITCS.2022.93.
Khanna, Sanjeev, & Konrad, Christian. Optimal Bounds for Dominating Set in Graph Streams. Leibniz international proceedings in informatics, 215 (). Retrieved from https://par.nsf.gov/biblio/10329638. https://doi.org/10.4230/LIPIcs.ITCS.2022.93
@article{osti_10329638,
place = {Country unknown/Code not available},
title = {Optimal Bounds for Dominating Set in Graph Streams},
url = {https://par.nsf.gov/biblio/10329638},
DOI = {10.4230/LIPIcs.ITCS.2022.93},
abstractNote = {},
journal = {Leibniz international proceedings in informatics},
volume = {215},
author = {Khanna, Sanjeev and Konrad, Christian},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.