Finding the closed partition of a planar graph (Q1322561)
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: Finding the closed partition of a planar graph |
scientific article; zbMATH DE number 563264
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the closed partition of a planar graph |
scientific article; zbMATH DE number 563264 |
Statements
Finding the closed partition of a planar graph (English)
0 references
5 May 1994
0 references
compact digraph
0 references
dual graph
0 references
planar graph
0 references
strongly connected component
0 references
closed partition
0 references
directed graph
0 references
program verification
0 references
sequential algorithm
0 references
0 references
0 references
0 references
0 references
0.87859535
0 references
0.8714099
0 references
0 references
0 references
0.8623587
0 references
