Pages that link to "Item:Q1887150"
From MaRDI portal
The following pages link to The complexity of planarity testing (Q1887150):
Displaying 11 items.
- The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) (← links)
- Planar and grid graph reachability problems (Q733742) (← 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)
- Planarity Testing Revisited (Q3010433) (← links)
- The Isomorphism Problem for k-Trees Is Complete for Logspace (Q3182953) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- (Q5090955) (← links)
