Pages that link to "Item:Q5144906"
From MaRDI portal
The following pages link to Fully-dynamic planarity testing in polylogarithmic time (Q5144906):
Displaying 9 items.
- Single-source shortest paths and strong connectivity in dynamic planar graphs (Q2051854) (← links)
- Work-sensitive dynamic complexity of formal languages (Q2233429) (← links)
- Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
- A direct linear-time planarity test for unflippable modules (Q3804209) (← links)
- Atomic Embeddability, Clustered Planarity, and Thickenability (Q5066950) (← links)
- Fast incremental planarity testing (Q5204329) (← links)
- Maintaining triconnected components under node expansion (Q6057331) (← links)
- Synchronized Planarity with Applications to Constrained Planarity Problems (Q6075858) (← links)
- Maintaining triconnected components under node expansion (Q6601461) (← links)