BibTeX record journals/jal/LarmoreP98

download as .bib file

@article{DBLP:journals/jal/LarmoreP98,
  author       = {Lawrence L. Larmore and
                  Teresa M. Przytycka},
  title        = {The Optimal Alphabetic Tree Problem Revisited},
  journal      = {J. Algorithms},
  volume       = {28},
  number       = {1},
  pages        = {1--20},
  year         = {1998},
  url          = {https://doi.org/10.1006/jagm.1998.0934},
  doi          = {10.1006/JAGM.1998.0934},
  timestamp    = {Sun, 28 May 2017 13:24:58 +0200},
  biburl       = {https://dblp.org/rec/journals/jal/LarmoreP98.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.