Partitioning the vertex set of an acyclic directed graph into convex subsets

MaRDI QIDQ583239zbMATH OpenFDO

Authors G. S. Eremin

Publication date 1987

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

digraphconvex setsvertex partitionconcave vertex sets

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Cited in

(3)

• Algorithms for generating convex sets in acyclic digraphs
• 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

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)