An algorithm for finding input-output constrained convex sets in an acyclic digraph

DOI10.1016/J.JDA.2012.02.002zbMATH Open1248.05078OpenAlexW2046013031MaRDI QIDQ450526FDOQ450526

Authors: G. Gutin, J. Reddington, A. Yeo, A. Johnstone, E. Scott 

Publication date: 13 September 2012

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2012.02.002

Recommendations

• An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
• Algorithms for generating convex sets in acyclic digraphs
• Partitioning the vertex set of an acyclic directed graph into convex subsets
• Convex sets in acyclic digraphs
• On the number of connected convex subgraphs of a connected acyclic digraph

zbMATH Keywords

acyclic digraphinput-output convex setIOCC

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Convex sets in (3) dimensions (including convex surfaces) (52A15) Computer system organization (68M99)

Cites Work

• Digraphs
• Algorithms for generating convex sets in acyclic digraphs
• An algorithm for finding input-output constrained convex sets in an acyclic digraph

Cited In (7)

• An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph
• Partitioning the vertex set of an acyclic directed graph into convex subsets
• An algorithm for finding input-output constrained convex sets in an acyclic digraph
• Acyclic digraphs
• On the number of connected convex subgraphs of a connected acyclic digraph
• Algorithms for generating convex sets in acyclic digraphs
• A review of tree convex sets test

Uses Software

• MiBench

This page was built for publication: An algorithm for finding input-output constrained convex sets in an acyclic digraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450526)