An algorithm for finding input-output constrained convex sets in an acyclic digraph
From MaRDI portal
Publication:450526
DOI10.1016/j.jda.2012.02.002zbMath1248.05078OpenAlexW2046013031MaRDI QIDQ450526
Anders Yeo, Gregory Gutin, J. Reddington, Elizabeth A. Scott, Adrian Johnstone
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
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99) Convex sets in (3) dimensions (including convex surfaces) (52A15) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph ⋮ An algorithm for finding input-output constrained convex sets in an acyclic digraph ⋮ On the number of connected convex subgraphs of a connected acyclic digraph ⋮ Acyclic Digraphs
Uses Software
Cites Work
This page was built for publication: An algorithm for finding input-output constrained convex sets in an acyclic digraph
