A linear time algorithm for finding maximal planar subgraphs (Q6487983)
From MaRDI portal
scientific article; zbMATH DE number 7666531
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear time algorithm for finding maximal planar subgraphs |
scientific article; zbMATH DE number 7666531 |
Statements
A linear time algorithm for finding maximal planar subgraphs (English)
0 references
21 March 2023
0 references
0 references
