h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth

; ; ;

In
Logical methods in computer science 22(2), Seiten/Artikel-Nr.:0

Konferenz/Event:32. EACSL Annual Conference on Computer Science Logic , CSL 2024

ImpressumErlangen : Logical Methods in Computer Science e.V.

ISSN1860-5974

Hefttitel: Selected Papers of the 32nd EACSL Annual Conference on Computer Science Logic (CSL 2024)

Online
DOI: 10.46298/lmcs-22(2:33)2026


Einrichtungen

  1. Lehrstuhl für Logik und Theorie diskreter Systeme (Informatik 7) (122910)


Thematische Einordnung (Klassifikation)
DDC: 004


Dokumenttyp
Journal Article

Format
online

Sprache
English

Anmerkung
Peer reviewed article

Interne Identnummern
RWTH-2026-06334
Datensatz-ID: 1038170

Lizenzstatus der Zeitschrift

 GO

Creative Commons Attribution CC BY (No Version) ; DOAJ ; Clarivate Analytics Master Journal List ; Current Contents - Engineering, Computing and Technology ; DOAJ Seal ; Essential Science Indicators ; IF < 5 ; JCR ; SCOPUS ; Science Citation Index Expanded ; Web of Science Core Collection
QR Code for this record

The record appears in these collections:
Document types > Articles > Journal Articles
Faculty of Computer Science (Fac.9)
Documents in print
Public records
122910
 Record created 2026-06-30, last modified 2026-07-02
Similar records



Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)