BibTeX record journals/ijfcs/BonizzoniVM00

download as .bib file

@article{DBLP:journals/ijfcs/BonizzoniVM00,
  author       = {Paola Bonizzoni and
                  Gianluca Della Vedova and
                  Giancarlo Mauri},
  title        = {Approximating the Maximum Isomorphic Agreement Subtree is Hard},
  journal      = {Int. J. Found. Comput. Sci.},
  volume       = {11},
  number       = {4},
  pages        = {579--590},
  year         = {2000},
  url          = {https://doi.org/10.1142/S0129054100000363},
  doi          = {10.1142/S0129054100000363},
  timestamp    = {Wed, 14 Nov 2018 10:45:23 +0100},
  biburl       = {https://dblp.org/rec/journals/ijfcs/BonizzoniVM00.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.