Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth
Saved in:
| Published in: | Logical Methods in Computer Science |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
| _version_ | 1869391328101531648 |
|---|---|
| collection | WordPress RSS FRELIP Feed Integration |
| container_title | Logical Methods in Computer Science |
| description | |
| discipline_display | Computer Sciience |
| discipline_facet | Computer Sciience |
| format | Online Article RSS Article |
| genre | Journal Article |
| id | rss_article:97250 |
| institution | FRELIP |
| journal_source_facet | Logical Methods in Computer Science |
| last_indexed | 2026-06-30T03:34:56.776Z |
| publishDate | 2026 |
| publishDateSort | 2026 |
| record_format | rss_article |
| spellingShingle | Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth Computer Sciience General Computer Sciience |
| sub_discipline_display | General |
| sub_discipline_facet | General |
| subject_display | Computer Sciience General Computer Sciience |
| subject_facet | Computer Sciience General Computer Sciience |
| title | Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth |
| title_alt | Profundizando y ampliando: lógica de conteo e indistinguibilidad de homomorfismos en grafos de profundidad arbórea y anchura arbórea acotadas Aller en profondeur et en largeur : logique de comptage et indistinguabilité des homomorphismes sur les graphes de profondeur d'arbre et de largeur d'arbre bornées Indo fundo e indo largo: Lógica de contagem e indistinguibilidade de homomorfismo em grafos de profundidade de árvore e largura de árvore limitadas |
| title_auth | Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth |
| title_es_txt | Profundizando y ampliando: lógica de conteo e indistinguibilidad de homomorfismos en grafos de profundidad arbórea y anchura arbórea acotadas |
| title_fr_txt | Aller en profondeur et en largeur : logique de comptage et indistinguabilité des homomorphismes sur les graphes de profondeur d'arbre et de largeur d'arbre bornées |
| title_full | Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth |
| title_fullStr | Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth |
| title_full_unstemmed | Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth |
| title_pt_txt | Indo fundo e indo largo: Lógica de contagem e indistinguibilidade de homomorfismo em grafos de profundidade de árvore e largura de árvore limitadas |
| title_short | Going deep and going wide: Counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth |
| title_sort | going deep and going wide: counting logic and homomorphism indistinguishability over graphs of bounded treedepth and treewidth |
| topic | Computer Sciience General Computer Sciience |
| url | https://doi.org/10.46298/lmcs-22(2:33)2026 |