Pages that link to "Item:Q1044043"
From MaRDI portal
The following pages link to Algorithms for generating convex sets in acyclic digraphs (Q1044043):
Displaying 6 items.
- Generating and enumerating digitally convex sets of trees (Q295254) (← links)
- An algorithm for finding input-output constrained convex sets in an acyclic digraph (Q450526) (← links)
- Partitioning the vertex set of an acyclic directed graph into convex subsets (Q583239) (← links)
- Convex sets in acyclic digraphs (Q1016095) (← links)
- On the number of connected convex subgraphs of a connected acyclic digraph (Q1028149) (← links)
- Acyclic Digraphs (Q3120435) (← links)