The following pages link to (Q4501524):
Displaying 15 items.
- Testing approximate symmetry in the plane is NP-hard (Q1176235) (← links)
- The combinatorial approach yields an NC algorithm for computing Pfaffians (Q1887034) (← links)
- The complexity of planarity testing (Q1887150) (← links)
- The complexity of oblivious plans for orienting and distinguishing polygonal parts (Q1900891) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← 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)
- Classification and detection of obstructions to planarity (Q3201104) (← links)
- Testing contractibility in planar rips complexes (Q3602926) (← links)
- (Q3975151) (← links)
- (Q4635977) (← links)
- Fully-dynamic planarity testing in polylogarithmic time (Q5144906) (← links)
- Practical Experience with Hanani-Tutte for Testing c-Planarity (Q5232494) (← links)