Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
(Sets of ) Complement Scattered Factors
Duncan Adamson, Pamela Fleischmann, Annika Huch
Starting in the 1970s with the fundamental work of Imre Simon, \emph{scattered factors} (also known as subsequences or scattered subwords) have remained a consistently and heavily…
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.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…