{"status":"public","date_created":"2018-03-28T07:22:42Z","intvolume":"      6034","_id":"1905","doi":"10.1007/978-3-642-12200-2_27","publication":"LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings","page":"294--305","year":"2010","publication_identifier":{"isbn":["978-3-642-12199-9"]},"user_id":"15504","department":[{"_id":"79"}],"publisher":"Springer","date_updated":"2022-01-06T06:53:57Z","type":"conference","citation":{"mla":"Gall, Dominik, et al. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, vol. 6034, Springer, 2010, pp. 294--305, doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>.","ieee":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, and H. Täubig, “Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization,” in <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 2010, vol. 6034, pp. 294--305.","ama":"Gall D, Jacob R, W. Richa A, Scheideler C, Schmid S, Täubig H. Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In: <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>. Vol 6034. Lecture Notes in Computer Science. Springer; 2010:294--305. doi:<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>","apa":"Gall, D., Jacob, R., W. Richa, A., Scheideler, C., Schmid, S., &#38; Täubig, H. (2010). Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization. In <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i> (Vol. 6034, pp. 294--305). Springer. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>","short":"D. Gall, R. Jacob, A. W. Richa, C. Scheideler, S. Schmid, H. Täubig, in: LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings, Springer, 2010, pp. 294--305.","chicago":"Gall, Dominik, Riko Jacob, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Hanjo Täubig. “Time Complexity of Distributed Topological Self-Stabilization: The Case of Graph Linearization.” In <i>LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings</i>, 6034:294--305. Lecture Notes in Computer Science. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">https://doi.org/10.1007/978-3-642-12200-2_27</a>.","bibtex":"@inproceedings{Gall_Jacob_W. Richa_Scheideler_Schmid_Täubig_2010, series={Lecture Notes in Computer Science}, title={Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization}, volume={6034}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-12200-2_27\">10.1007/978-3-642-12200-2_27</a>}, booktitle={LATIN 2010: Theoretical Informatics, 9th Latin American Symposium, Oaxaca, Mexico, April 19-23, 2010. Proceedings}, publisher={Springer}, author={Gall, Dominik and Jacob, Riko and W. Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Täubig, Hanjo}, year={2010}, pages={294--305}, collection={Lecture Notes in Computer Science} }"},"author":[{"full_name":"Gall, Dominik","last_name":"Gall","first_name":"Dominik"},{"first_name":"Riko","last_name":"Jacob","full_name":"Jacob, Riko"},{"last_name":"W. Richa","first_name":"Andrea","full_name":"W. Richa, Andrea"},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"full_name":"Täubig, Hanjo","last_name":"Täubig","first_name":"Hanjo"}],"title":"Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization","series_title":"Lecture Notes in Computer Science","volume":6034}