Pages that link to "Item:Q1887150"

The following pages link to The complexity of planarity testing (Q1887150):

Displaying 22 items.

• The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
• Planar and grid graph reachability problems (Q733742) (← links)
• Testing approximate symmetry in the plane is NP-hard (Q1176235) (← links)
• The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
• Approximation in (Poly-) logarithmic space (Q2037114) (← links)
• Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
• Depth-first search in directed planar graphs, revisited (Q2170277) (← links)
• Constant work-space algorithms for facility location problems (Q2192101) (← links)
• Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
• On the computational complexity of upward and rectilinear planarity testing (Q2784472) (← links)
• Testing Full Outer-2-planarity in Linear Time (Q2827826) (← links)
• A Planarity Test via Construction Sequences (Q2849960) (← links)
• Planarity Testing Revisited (Q3010433) (← links)
• The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
• Classification and detection of obstructions to planarity (Q3201104) (← links)
• (Q3975151) (← links)
• (Q4501524) (← links)
• (Q4635977) (← links)
• Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
• (Q5090955) (← links)
• Fully-dynamic planarity testing in polylogarithmic time (Q5144906) (← links)
• Practical Experience with Hanani-Tutte for Testing c-Planarity (Q5232494) (← links)