Showing 2024Show all
3 papers · 1 filter
cs.DS2024
Rollercoasters with Plateaus
Duncan Adamson, Pamela Fleischmann, Annika Huch
In this paper we investigate the problem of detecting, counting, and enumerating (generating) all maximum length plateau--rollercoasters appearing as a subsequence of some given…
cs.FL2024
Tight Bounds for the Number of Absent Subsequences
Duncan Adamson, Pamela Fleischmann, Annika Huch +3
A {\em subsequence} of a word is a word that can be obtained by deleting some letters from while maintaining the relative order of the remaining letters, e.g., $\mathtt…
cs.DS2024
Enumerating m-Length Walks in Directed Graphs with Constant Delay
Duncan Adamson, Pawel Gawrychowski, Florin Manea
In this paper, we provide a novel enumeration algorithm for the set of all walks of a given length within a directed graph. Our algorithm has worst-case constant delay between outp…