Algorithms for generating convex sets in acyclic digraphs

P. Balister; S. Gerke; G. Gutin; A. Johnstone; J. Reddington; E. Scott; A. Soleimanfallah; A. Yeo

doi:10.1016/j.jda.2008.07.008

Algorithms for generating convex sets in acyclic digraphs

P. Balister
, S. Gerke
, G. Gutin
, A. Johnstone
, J. Reddington
, E. Scott
, A. Soleimanfallah
, A. Yeo

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	509–518
Number of pages	10
Journal	Journal of Discrete Algorithms
Volume	7
Issue number	4
Early online date	13 Aug 2008
DOIs	https://doi.org/10.1016/j.jda.2008.07.008
Publication status	Published - Dec 2009

Keywords

Embedded processors

Access to Document

10.1016/j.jda.2008.07.008

http://www.sciencedirect.com/science/article/pii/S1570866708000622

1 Conference contribution
1 Paper
1 Article

Better Than Optimal: Fast Identification of Custom Instruction Candidates
Reddington, J., Gutin, G., Johnstone, A., Scott, E. & Yeo, A., 2009, CSE '09: International Conference on Computational Science and Engineering, 2009. Vol. 2. p. 17-24 8 p.
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
Gutin, G., Johnstone, A., Reddington, J., Scott, E., Yeo, A., Broersma, H. (Editor), Erlebach, T. (Editor), Friedeizky, T. (Editor) & Paulusma, D. (Editor), 2008, In: Lecture Notes in Computer Science. 5344, p. 206-217 12 p.
Research output: Contribution to journal › Article › peer-review
An algorithm for finding connected convex subgraphs of an acyclic digraph
Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A. & Yeo, A., 2007, p. 69-82. 14 p.
Research output: Contribution to conference › Paper › peer-review

Cite this

@article{495915c1cc71411090599a1e6d6c48e6,

title = "Algorithms for generating convex sets in acyclic digraphs",

keywords = "Embedded processors",

author = "P. Balister and S. Gerke and G. Gutin and A. Johnstone and J. Reddington and E. Scott and A. Soleimanfallah and A. Yeo",

year = "2009",

month = dec,

doi = "10.1016/j.jda.2008.07.008",

language = "English",

volume = "7",

pages = "509–518",

journal = "Journal of Discrete Algorithms",

issn = "1570-8667",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Algorithms for generating convex sets in acyclic digraphs

AU - Balister, P.

AU - Gerke, S.

AU - Gutin, G.

AU - Johnstone, A.

AU - Reddington, J.

AU - Scott, E.

AU - Soleimanfallah, A.

AU - Yeo, A.

PY - 2009/12

Y1 - 2009/12

KW - Embedded processors

U2 - 10.1016/j.jda.2008.07.008

DO - 10.1016/j.jda.2008.07.008

M3 - Article

SN - 1570-8667

VL - 7

SP - 509

EP - 518

JO - Journal of Discrete Algorithms

JF - Journal of Discrete Algorithms

IS - 4

ER -

Algorithms for generating convex sets in acyclic digraphs

Keywords

Access to Document

Research output

Better Than Optimal: Fast Identification of Custom Instruction Candidates

An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph

An algorithm for finding connected convex subgraphs of an acyclic digraph

Cite this