BibTeX Export for Graph matching with type constraints on nodes and edges

Copy to Clipboard Download

@InProceedings{fraikin_et_al:DagSemProc.07071.11,
  author =	{Fraikin, Catherine and Van Dooren, Paul},
  title =	{{Graph matching with type constraints on nodes and edges}},
  booktitle =	{Web Information Retrieval and Linear Algebra Algorithms},
  pages =	{1--16},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7071},
  editor =	{Andreas Frommer and Michael W. Mahoney and Daniel B. Szyld},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.07071.11},
  URN =		{urn:nbn:de:0030-drops-10716},
  doi =		{10.4230/DagSemProc.07071.11},
  annote =	{Keywords: Graph matching, Optimization, Typed nodes, Typed edges}
}

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