Q4635977
type: Item
instance of: scholarly article
zbMATH Open document ID: 1388.05047
publication date: 2018-04-23T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6863595
zbMATH Keywords: S\&H algorithm
zbMATH Keywords: PC-tree algorithm
MaRDI profile type: Publication
Recommended article: Q4501524
Recommended article: The complexity of planarity testing
Recommended article: Planarity Testing Revisited
Recommended article: Q3730016
Recommended article: Hierarchical planarity testing algorithms
Recommended article: Q3785966
Recommended article: Orthogonal planarity testing of bounded treewidth graphs
Recommended article: Planarity Algorithms via PQ-Trees (Extended Abstract)
Recommended article: Incremental convex planarity testing
Recommended article: Q5417619
description: scientific article; zbMATH DE number 6863595