Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915590347685888 |
|---|---|
| author | Wild, Marcel |
| author_facet | Wild, Marcel |
| contents | Various algorithms have been proposed to enumerate all connected induced subgraphs of a graph $G=(V,E)$. As a variation we enumerate all "packings of connected sets", i.e. partitions $Π$ of $V$ with the property that each part of $Π$ induces a connected subgraph. More generally, for various types $T$ of graphs we do (one or both of) the following: (i) enumerate all type $T$ (induced) subgraphs of a given graph $G$, or (ii) enumerate all packings of type $T$ subgraphs of $G$ |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_01540 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well Wild, Marcel Combinatorics Discrete Mathematics Various algorithms have been proposed to enumerate all connected induced subgraphs of a graph $G=(V,E)$. As a variation we enumerate all "packings of connected sets", i.e. partitions $Π$ of $V$ with the property that each part of $Π$ induces a connected subgraph. More generally, for various types $T$ of graphs we do (one or both of) the following: (i) enumerate all type $T$ (induced) subgraphs of a given graph $G$, or (ii) enumerate all packings of type $T$ subgraphs of $G$ |
| title | Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well |
| topic | Combinatorics Discrete Mathematics |
| url | https://arxiv.org/abs/2412.01540 |