Partitioning the vertex set of an acyclic directed graph into convex subsets
From MaRDI portal
Publication:583239
zbMATH Open0692.05052MaRDI QIDQ583239FDOQ583239
Publication date: 1987
Published in: Automation and Remote Control (Search for Journal in Brave)
Recommendations
- 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
- Algorithms for generating convex sets in acyclic digraphs
- Partitioning vertices into in- and out-dominating sets in digraphs
- Convex \(p\)-partitions of bipartite graphs
Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
This page was built for publication: Partitioning the vertex set of an acyclic directed graph into convex subsets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q583239)
