The following pages link to Convex sets in acyclic digraphs (Q1016095):
Displaying 4 items.
- An algorithm for finding input-output constrained convex sets in an acyclic digraph (Q450526) (← links)
- On the number of connected convex subgraphs of a connected acyclic digraph (Q1028149) (← links)
- Algorithms for generating convex sets in acyclic digraphs (Q1044043) (← links)
- Convex sets under some graph operations (Q1865635) (← links)