5 papers
Polynomial-time satisfiability for a special case of PositiveNegative
Marcel Wild
A Boolean function in CNF format is of type PositiveNegative} if each clause C is either positive (i.e. all literals of C are positive) or negative (i.e. all literals of C…
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 . As a variation we enumerate all "packings of connected sets", i.e. partitio…
Enumerating all geodesics
Marcel Wild
By "geodesic" we mean any sequence of vertices of a graph that constitute a shortest path from to . We propose a novel, natural algorithm to enum…
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 that induce…
Advertising finite commutative semigroups
Marcel Wild
Every mathematician is familiar with the beautiful structure of finite commutative groups. What is less well known is that finite commutative semigroups also have a neat and well-d…