Pages that link to "Item:Q1117237"
From MaRDI portal
The following pages link to A new approach to the linearity of testing planarity of graphs (Q1117237):
Displaying 11 items.
- A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
- An algorithm of graph planarity testing and cross minimization (Q1049731) (← links)
- On the linearity of testing planarity of graphs (Q1095918) (← links)
- A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid (Q1382254) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- On Boolean characterizations of planarity and planar embeddings of graphs (Q2276969) (← links)
- (Q3338271) (← links)
- A direct linear-time planarity test for unflippable modules (Q3804209) (← links)
- An algorithm for an 𝓁<sup>2</sup>-homological test for the planarity of a graph (Q4956221) (← links)
- Testing Planarity of Partially Embedded Graphs (Q4962193) (← links)
- Rectilinear Planarity Testing of Plane Series-Parallel Graphs in Linear Time (Q5014135) (← links)