![[img]](https://epub.uni-regensburg.de/style/images/fileicons/application_pdf.png) | Lizenz: Creative Commons Namensnennung 4.0 International PDF - Veröffentlichte Version (804kB) |
- URN zum Zitieren dieses Dokuments:
- urn:nbn:de:bvb:355-epub-746003
- DOI zum Zitieren dieses Dokuments:
- 10.5283/epub.74600
Zusammenfassung
The Weisfeiler-Leman (WL) dimension is an established measure for the inherent descriptive complexity of graphs and relational structures. It corresponds to the number of variables that are needed and sufficient to define the object of interest in a counting version of first-order logic (FO). These bounded-variable counting logics were even candidates to capture graph isomorphism, until a ...
Nur für Besitzer und Autoren: Kontrollseite des Eintrags
Downloadstatistik