Partitioning the vertex set of an acyclic directed graph into convex subsets (Q583239)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning the vertex set of an acyclic directed graph into convex subsets |
scientific article; zbMATH DE number 4132208
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning the vertex set of an acyclic directed graph into convex subsets |
scientific article; zbMATH DE number 4132208 |
Statements
Partitioning the vertex set of an acyclic directed graph into convex subsets (English)
0 references
1987
0 references
vertex partition
0 references
digraph
0 references
convex sets
0 references
concave vertex sets
0 references
0.7718628644943237
0 references
0.7659508585929871
0 references
0.761902928352356
0 references
0.7282323241233826
0 references
0.7213304042816162
0 references
