A set X of vertices of an acyclic graph is convex if any vertex on a directed path between elements of X is itself in X. We construct an algorithm for generating all input-output constrained convex (IOCC) sets in an acyclic digraph, which uses several novel ideas. We show that our algorithm is more efficient than algorithms described in the literature in both the worst case and computational experiments. IOCC sets of acyclic digraphs are of interest in the area of modern embedded processor technology. © 2008 Springer Berlin Heidelberg.
CITATION STYLE
Gutin, G., Johnstone, A., Reddington, J., Scott, E., & Yeo, A. (2008). An algorithm for finding input-output constrained convex sets in an acyclic digraph. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5344 LNCS, pp. 206–217). https://doi.org/10.1007/978-3-540-92248-3_19
Mendeley helps you to discover research relevant for your work.