Parallel complexity of partitioning a planar graph into vertex-induced forests (Q1923610)
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: Parallel complexity of partitioning a planar graph into vertex-induced forests |
scientific article; zbMATH DE number 933121
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel complexity of partitioning a planar graph into vertex-induced forests |
scientific article; zbMATH DE number 933121 |
Statements
Parallel complexity of partitioning a planar graph into vertex-induced forests (English)
0 references
3 February 1997
0 references
vertex-arboricity
0 references
optimal NC algorithms
0 references
