Marcel Wild

collaborators

3 papers

math.CO2024

Compression with wildcards: Enumerating specific induced subgraphs, and packing them as well

Marcel Wild

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. partitio…

math.CO2024

Enumerating all geodesics

Marcel Wild

By "geodesic" we mean any sequence of vertices $(v_{1}, v_{2}, ..., v_{k})$ of a graph $G$ that constitute a shortest path from $v_{1}$ to $v_{k}$ . We propose a novel, natural algorithm to enum…

math.CO2024

Compression with wildcards: All induced metric subgraphs

Marcel Wild

Driven by applications in the natural, social and computer sciences several algorithms have been proposed to enumerate all sets $X\s V$ of vertices of a graph $G = (V, E)$ that induce…