A new approach to the linearity of testing planarity of graphs (Q1117237): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the linearity of testing planarity of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preuve Algebrique Du Critere De Planarite De Wu-Liu / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Toward a theory of crossing numbers / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3230884 / rank | |||
Normal rank | |||
Latest revision as of 14:30, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new approach to the linearity of testing planarity of graphs |
scientific article |
Statements
A new approach to the linearity of testing planarity of graphs (English)
0 references
1988
0 references
The author presents a new approach to the linearity complexity for testing planarity of a graph G by transforming the problem into that of finding a spanning tree on another graph H, with the order of H being a linear function of G.
0 references
planarity testing
0 references
testing planarity
0 references
spanning tree
0 references
