%0 Journal Article %1 journals/ipl/DahlhausDR04 %A Dahlhaus, Elias %A Dankelmann, Peter %A Ravi, R. %D 2004 %J Inf. Process. Lett. %K dblp %N 5 %P 255-259 %T A linear-time algorithm to compute a MAD tree of an interval graph. %U http://dblp.uni-trier.de/db/journals/ipl/ipl89.html#DahlhausDR04 %V 89

@article{journals/ipl/DahlhausDR04, added-at = {2015-08-31T00:00:00.000+0200}, author = {Dahlhaus, Elias and Dankelmann, Peter and Ravi, R.}, biburl = {https://www.bibsonomy.org/bibtex/2bfbdf2f5a4d4387b2232cce3afd41900/dblp}, ee = {http://dx.doi.org/10.1016/j.ipl.2003.11.009}, interhash = {960eacd82b6aa8b97922757bb2c9079c}, intrahash = {bfbdf2f5a4d4387b2232cce3afd41900}, journal = {Inf. Process. Lett.}, keywords = {dblp}, number = 5, pages = {255-259}, timestamp = {2015-09-01T11:33:06.000+0200}, title = {A linear-time algorithm to compute a MAD tree of an interval graph.}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl89.html#DahlhausDR04}, volume = 89, year = 2004 }