BibTeX Export for Faster Algorithms for the Maximum Common Subtree Isomorphism Problem

Copy to Clipboard Download

@InProceedings{droschinsky_et_al:LIPIcs.MFCS.2016.33,
  author =	{Droschinsky, Andre and Kriege, Nils M. and Mutzel, Petra},
  title =	{{Faster Algorithms for the Maximum Common Subtree Isomorphism Problem}},
  booktitle =	{41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016)},
  pages =	{33:1--33:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-016-3},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{58},
  editor =	{Faliszewski, Piotr and Muscholl, Anca and Niedermeier, Rolf},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.33},
  URN =		{urn:nbn:de:0030-drops-64475},
  doi =		{10.4230/LIPIcs.MFCS.2016.33},
  annote =	{Keywords: MCS, maximum common subtree, enumeration algorithms, maximum weight bipartite matchings}
}

The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.

Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode