License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2012.14
URN: urn:nbn:de:0030-drops-36612
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3661/
Go to the corresponding Portal

Makowsky, Johann A.

Definability and Complexity of Graph Parameters (Invited Talk)

pdf-format:
Document 1.pdf (212 KB)

Abstract

In this talk we survey definability and complexity results of graph parameters which take values in some ring or field R.

BibTeX - Entry

@InProceedings{makowsky:LIPIcs:2012:3661,
  author =	{Johann A. Makowsky},
  title =	{{Definability and Complexity of Graph Parameters (Invited Talk)}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{14--15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{Patrick C{\'e}gielski and Arnaud Durand},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3661},
  URN =		{urn:nbn:de:0030-drops-36612},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.CSL.2012.14},
  annote =	{Keywords: Model theory, finite model theory, graph invariants}
}

Keywords: Model theory, finite model theory, graph invariants
Seminar: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL
Issue Date: 2012
Date of publication: 27.08.2012

DROPS-Home | Fulltext Search | Imprint Published by LZI