Polylogarithmic-Overhead Piecemeal Graph Exploration
Abstract
Article Polylogarithmic-overhead piecemeal graph exploration Share on Authors: Baruch Awerbuch Johns Hopkins University, Baltimore, MD and MIT Lab. for Computer Science Johns Hopkins University, Baltimore, MD and MIT Lab. for Computer ScienceView Profile , Stephen G. Kobourov Dept. of Computer Science, Johns Hopkins University, Baltimore, MD Dept. of Computer Science, Johns Hopkins University, Baltimore, MDView Profile Authors Info & Claims COLT' 98: Proceedings of the eleventh annual conference on Computational learning theoryJuly 1998 Pages 280–286https://doi.org/10.1145/279943.279998Online:24 July 1998Publication History 12citation205DownloadsMetricsTotal Citations12Total Downloads205Last 12 Months3Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Cite
Text
Awerbuch and Kobourov. "Polylogarithmic-Overhead Piecemeal Graph Exploration." Annual Conference on Computational Learning Theory, 1998. doi:10.1145/279943.279998Markdown
[Awerbuch and Kobourov. "Polylogarithmic-Overhead Piecemeal Graph Exploration." Annual Conference on Computational Learning Theory, 1998.](https://mlanthology.org/colt/1998/awerbuch1998colt-polylogarithmic/) doi:10.1145/279943.279998BibTeX
@inproceedings{awerbuch1998colt-polylogarithmic,
title = {{Polylogarithmic-Overhead Piecemeal Graph Exploration}},
author = {Awerbuch, Baruch and Kobourov, Stephen G.},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1998},
pages = {280-286},
doi = {10.1145/279943.279998},
url = {https://mlanthology.org/colt/1998/awerbuch1998colt-polylogarithmic/}
}