Output details
11 - Computer Science and Informatics
Royal Holloway, University of London
Return to search
Output 0 of 0 in the submission
Article title
An algorithm for finding input-output constrained convex sets in an acyclic digraph
Type
D - Journal article
Title of journal
Journal of Discrete Algorithms
Article number
-
Volume number
13
Issue number
-
First page of article
47
ISSN of journal
1570-8667
Year of publication
2012
Number of additional authors
4
Additional information
<08> Asymptotically optimal algorithms do not always yield the fastest practical algorithms on realistic cases. Our 2009 algorithm for enumerating convex subgraphs of acyclic digraphs is optimal but not always practical for real world application, in this case to custom instruction identification in assembly code. This paper presents an input/output constrained version of the algorithm which is faster in practice than the theoretically optimal algorithm, making its application to assembly code generation more practical.
Interdisciplinary
-
Cross-referral requested
-
Research group
C - Centre for Software Language Engineering
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-