%0 Conference Paper %1 conf/latin/DuanH020 %A Duan, Ran %A He, Haoqing %A Zhang, Tianyi %B LATIN %D 2020 %E Kohayakawa, Yoshiharu %E Miyazawa, Flávio Keidi %I Springer %K dblp %P 15-26 %T Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees. %U http://dblp.uni-trier.de/db/conf/latin/latin2020.html#DuanH020 %V 12118 %@ 978-3-030-61792-9

@inproceedings{conf/latin/DuanH020, added-at = {2020-12-03T00:00:00.000+0100}, author = {Duan, Ran and He, Haoqing and Zhang, Tianyi}, biburl = {https://www.bibsonomy.org/bibtex/2e92f68193079ffb419e2e99a9e09b79e/dblp}, booktitle = {LATIN}, crossref = {conf/latin/2020}, editor = {Kohayakawa, Yoshiharu and Miyazawa, Flávio Keidi}, ee = {https://doi.org/10.1007/978-3-030-61792-9_2}, interhash = {5be37d600c3b7fbdb512fa1606f26502}, intrahash = {e92f68193079ffb419e2e99a9e09b79e}, isbn = {978-3-030-61792-9}, keywords = {dblp}, pages = {15-26}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T00:56:30.000+0200}, title = {Near-Linear Time Algorithm for Approximate Minimum Degree Spanning Trees.}, url = {http://dblp.uni-trier.de/db/conf/latin/latin2020.html#DuanH020}, volume = 12118, year = 2020 }