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

G. Gutin; A. Johnstone; Joseph Reddington; E. Scott; A. Yeo; Hajo Broersma; Thomas Erlebach; Tom Friedeizky; Daniel Paulusma

doi:10.1007/978-3-540-92248-3_19

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

G. Gutin
, A. Johnstone
, Joseph Reddington
, E. Scott
, A. Yeo
, Hajo Broersma (Editor)
, Thomas Erlebach (Editor)
, Tom Friedeizky (Editor)
, Daniel Paulusma (Editor)

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

Original language	English
Pages (from-to)	206-217
Number of pages	12
Journal	Lecture Notes in Computer Science
Volume	5344
DOIs	https://doi.org/10.1007/978-3-540-92248-3_19
Publication status	Published - 2008

Access to Document

10.1007/978-3-540-92248-3_19

http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.139.1013&rep=rep1&type=pdf

1 Conference contribution
1 Paper
1 Article

Algorithms for generating convex sets in acyclic digraphs
Balister, P., Gerke, S., Gutin, G., Johnstone, A., Reddington, J., Scott, E., Soleimanfallah, A. & Yeo, A., Dec 2009, In: Journal of Discrete Algorithms. 7, 4, p. 509–518 10 p.
Research output: Contribution to journal › Article › peer-review
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 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{d99824e477c440eeaa2ea8a3102fc2f5,

title = "An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph",

author = "G. Gutin and A. Johnstone and Joseph Reddington and E. Scott and A. Yeo and Hajo Broersma and Thomas Erlebach and Tom Friedeizky and Daniel Paulusma",

year = "2008",

doi = "10.1007/978-3-540-92248-3\_19",

language = "English",

volume = "5344",

pages = "206--217",

journal = "Lecture Notes in Computer Science",

}

TY - JOUR

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

AU - Gutin, G.

AU - Johnstone, A.

AU - Reddington, Joseph

AU - Scott, E.

AU - Yeo, A.

A2 - Broersma, Hajo

A2 - Erlebach, Thomas

A2 - Friedeizky, Tom

A2 - Paulusma, Daniel

PY - 2008

Y1 - 2008

U2 - 10.1007/978-3-540-92248-3_19

DO - 10.1007/978-3-540-92248-3_19

M3 - Article

VL - 5344

SP - 206

EP - 217

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

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

Access to Document

Research output

Algorithms for generating convex sets in acyclic digraphs

Better Than Optimal: Fast Identification of Custom Instruction Candidates

An algorithm for finding connected convex subgraphs of an acyclic digraph

Cite this