The following pages link to (Q5668808):
Displaying 3 items.
- \(A\,V^ 2\) algorithm for determining isomorphism of planar graphs (Q2543430) (← links)
- Subrecursive program schemata I P II. I: Undecidable equivalence problems. II: Decidable equivalence problems (Q2559259) (← links)
- On the time required to detect cycles and connectivity in graphs (Q5641178) (← links)