Definability and Complexity of Graph Parameters (Invited Talk)

Author Johann A. Makowsky



PDF
Thumbnail PDF

File

LIPIcs.CSL.2012.14.pdf
  • Filesize: 212 kB
  • 2 pages

Document Identifiers

Author Details

Johann A. Makowsky

Cite AsGet BibTex

Johann A. Makowsky. Definability and Complexity of Graph Parameters (Invited Talk). In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 14-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.CSL.2012.14

Abstract

In this talk we survey definability and complexity results of graph parameters which take values in some ring or field R.
Keywords
  • Model theory
  • finite model theory
  • graph invariants

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads