%0 Conference Paper %1 conf/soda/BrodalFMPS13 %A Brodal, Gerth Stølting %A Fagerberg, Rolf %A Mailund, Thomas %A Pedersen, Christian N. S. %A Sand, Andreas %B SODA %D 2013 %E Khanna, Sanjeev %I SIAM %K dblp %P 1814-1832 %T Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree. %U http://dblp.uni-trier.de/db/conf/soda/soda2013.html#BrodalFMPS13 %@ 978-1-61197-310-5

@inproceedings{conf/soda/BrodalFMPS13, added-at = {2021-02-02T00:00:00.000+0100}, author = {Brodal, Gerth Stølting and Fagerberg, Rolf and Mailund, Thomas and Pedersen, Christian N. S. and Sand, Andreas}, biburl = {https://www.bibsonomy.org/bibtex/20318c0b4e8e8d3b9587fc0297216e7d2/dblp}, booktitle = {SODA}, crossref = {conf/soda/2013}, editor = {Khanna, Sanjeev}, ee = {https://doi.org/10.1137/1.9781611973105.130}, interhash = {a2fd945d5678826126b9dbe972d3bd68}, intrahash = {0318c0b4e8e8d3b9587fc0297216e7d2}, isbn = {978-1-61197-310-5}, keywords = {dblp}, pages = {1814-1832}, publisher = {SIAM}, timestamp = {2024-04-09T11:21:30.000+0200}, title = {Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.}, url = {http://dblp.uni-trier.de/db/conf/soda/soda2013.html#BrodalFMPS13}, year = 2013 }